以文本方式查看主题 - 计算机科学论坛 (http://bbs.xml.org.cn/index.asp) -- 『 Semantic Web(语义Web)/描述逻辑/本体 』 (http://bbs.xml.org.cn/list.asp?boardid=2) ---- IJCAI-09 accepted paper list (http://bbs.xml.org.cn/dispbbs.asp?boardid=2&rootid=&id=74232) |
-- 作者:windking8888 -- 发布时间:4/16/2009 7:33:00 AM -- IJCAI-09 accepted paper list Twenty-first International Joint Conference on Artificial Intelligence (IJCAI-09) The Interdisciplinary Reach of Artificial Intelligence Pasadena Conference Center Sponsored by The International Joint Conferences on Artificial Intelligence (IJCAI) and The Association for the Advancement of Artificial Intelligence (AAAI) 11: Trading Off Solution Cost for Smaller Runtime in DCOP Search Algorithms 17: Thou Shalt Covet Thy Neighbor's Cake 18: Nonmanipulable Selections from a Tournament 22: Spectral Kernel Learning for Semi-supervised Classification 30: Which Semantics for Neighbourhood Semantics? 35: A Characterisation of Strategy-Proofness for Grounded Argumentation Semantics 47: Extending Decidable Cases for Rules with Existential Variables 51: Early Classification on Time Series: A Nearest Neighbor Approach 62: Answer-Set Programming with Bounded Treewidth 64: Analysis of a winning computational billiards player 68: Local Learning Regularized Nonnegative Matrix Factorization 70: Efficient Inference for Expressive Comparative Preference Languages 73: Computational Properties of Resolution-based Grounded Semantics 77: Where are the really hard manipulation problems? The manipulation phase transition 92: Labellings and Games for Extended Argumentation Frameworks 94: The Fringe-Retrieving A* Search Algorithm for Moving Target Search 96: Sensing and Predicting Shared Bicycling Usage in the City 101: Knowledge-based WSD and specific domains: performing over supervised WSD 105: DCOPs Meet the Real World: Exploring Unknown Reward Matrices with applications to mobile sensor nets 106: Domain Adaptation via Transfer Component Analysis 119: Dialectical Abstract Argumentation: A Characterization of the Marking Criterion 120: New Improvements in Optimal Rectangle Packing 126: The Canadian Traveler Problem With Remote Sensing 128: CTPPL: A Continuous Time Probabilistic Programming Language 130: Strategyproof Classification with Shared Inputs 135: Linear Dimensionality Reduction for Multi-label Classification 139: An Efficient Nonnegative Matrix Factorization Approach in Flexible Kernel Space 143: Smart PCA 145: Multiscale Analysis of Document Corpora Based on Diffusion Models 149: Euclidean and Mereological Qualitative Spaces: a Study of SCC and DCC 151: Complexity of Unweighted Coalitional Manipulation Under Some Common Voting Rules 153: Solving 8x8 Hex 156: Axiomatic Characterization of Task Oriented Negotiation 161: Improving Search In Social Networks by Agent Based Mining 179: Active Policy Iteration: Efficient Exploration through Active Learning for Value Function Approximat 188: Markov Network based Ontology Matching 190: Fast Online Training of Discriminative Latent Variable Model and Its Case Studies in NLP 200: Succinct approximate counting of skewed data 207: Argumentation System with Changes of an Agent's Knowledge Base 210: Solving POMDPs: RTDP-Bel vs. Point-based Algorithms 211: Greedy Algorithms for Sequential Sensing Decisions 213: Simple Coalitional Games with Beliefs 216: Fast Active Tabu Search and its Application to Image Retrieval 217: Using Reasoning Patterns to Help Humans Solve Complex Games 219: Probabilistic state translation in extensive games with large action sets 224: Circuit Complexity and Decompositions of Global Constraints 229: Evaluating Abductive Hypotheses using an EM Algorithm on BDDs 230: Preference Aggregation over Restricted Ballot Languages: Sincerity and Strategy-Proofness 232: A structural approach to reasoning with quantified Boolean formulas 233: Predicting Learnt Clauses Quality in Modern SAT Solvers 234: Industrial-Like Random SAT Instances 239: Nested Monte-Carlo Search 241: Evaluating Description and Reference Strategies in a Cooperative Human-Robot Dialogue System 242: Can Movies and Books Collaborate? Cross-Domain Collaborative Filtering for Sparsity Reduction 251: On-line Evolutionary Exponential Family Mixture 256: Is it enough to get the behavior right? 258: Semi-supervised Metric Learning Using Pairwise Constraints 261: A New Bayesian Approach to Multiple Intermittent Fault Diagnosis 263: Coalitional Affinity Games and the Stability Gap 275: A Translation-Based Approach to Contingent Planning 276: Using web images for measuring video frame interestingness 283: Efficient Skill Learning using Abstraction Selection 284: Monte Carlo tree search techniques in the game of Kriegspiel 287: Event-detecting Multi-agent MDPs: Complexity and Constant-factor Approximations 289: Learning Conditional Preference Networks with Queries 291: Solving Dynamic Constraint Satisfaction Problems by Identifying Stable Features 300: Negotiation Using Logic Programming with Consistent Restoring Rules 302: Phi*: Incremental Any-Angle Path Planning on Grids 303: Realising Deterministic Behaviour from Multiple Non-Deterministic Behaviours 306: Memory-Based Heuristics for Explicit State Spaces 310: Goal-Driven Learning in the GILA Integrated Intelligence Architecture 316: Symmetric Splitting in the General Theory of Stable Models 317: Circumscriptive Event Calculus as Answer Set Programming 318: Efficient Dominant Point Algorithms for the Multiple Longest Common Subsequence (MLCS) Problem 319: HDP-HMM Based Abnormal Activity Recognition 320: Spatio-temporal Event Detection Using Dynamic Conditional Random Fields 328: Relation Regularized Matrix Factorization 341: Knowledge Driven Dimension Reduction For Clustering 347: How Pervasive is the Myerson-Satterthwaite Impossibility? 351: A Dichotomy Theorem on the Existence of Efficient or Neutral Sequential Voting Correspondences 353: Selecting Informative Universum Sample for Semi-Supervised Learning 357: Topic tracking model for analyzing consumer purchase behavior 361: Decompositions of All Different, Global Cardinality and Related Constraints 362: Manifold Alignment without Correspondence 365: Variable and Value Ordering for MPE Search 366: Learning to Follow Navigational Route Instructions 374: Cost-Optimal Planning with Landmarks 375: Graph-Based Multi-Modality Learning for Topic-Focused Multi-Document Summarization 376: Sketching Techniques for Collaborative Filtering 383: A General Approach to Environment Design with One Agent 385: Completeness and Optimality Preserving Reduction for Planning 386: Stratified Planning 398: On the Tip of my Thought: Playing the Guillotine Game 410: Making Bound Consistency as Effective as Arc Consistency 414: Modeling Agents through Bounded Rationality Theories 415: Expressive Power-Based Resource Allocation for Data Centers 418: Towards an Argumentative Interpreter for Golog Programs 430: Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving Delete Relaxation Heuristics 431: Reasoning with lines in the Euclidean space 432: Local Search: Is brute-force avoidable? 435: Model-based Revision Operators for Terminologies in Description Logics 436: On the Accrual of Arguments in Defeasible Logic Programming 445: Multimode Control Attacks on Elections 451: Domain Specific Opinion Word Propagation 456: Best-First Heuristic Search for Multi-Core Machines 461: Bayesian Real-time Dynamic Programming 473: On Multiple Kernel Learning with Multiple Labels 474: Generalized Cluster Aggregation 482: How hard is it to control sequential elections via the agenda? 484: Goal Recognition with Variable-Order Markov Models 485: A Soft Global Precedence Constraint 488: A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes 492: Ranking Structured Documents: A Large Margin Based Approach for Patent Prior Art Search 493: Self-Managing Associative Memory for Dynamic Acquisition of Expertise in High-Level Domains 495: Forgetting and uniform interpolation in large-scale description logic terminologies 498: Delaying Commitment in Plan Recognition Using Combinatory Categorial Grammars 500: Algorithms and Complexity Results for Pursuit-Evasion Problems 505: Minimal Module Extraction from DL-Lite Ontologies using QBF Solvers 507: Preference Functions That Score Rankings and Maximum Likelihood Estimation 508: CI-Nets: A Graphical Language for Representing Ordinal, Monotonic Preferences over Sets of Goods 519: Predictive Projections 524: Decomposition of Declarative Knowledge Bases with External Functions 526: Introspection and Adaptable Model Integration for Dialogue-based Question Answering 528: A symmetry reduction technique for model checking temporal epistemic logic 529: Learning Optimal Subsets with Implicit User Preferences 531: Next Steps in Propositional Horn Contraction 536: Exchanging Reputation Information Between Communities: A Payment-Function 548: Evaluating Strategies for Running from the Cops 549: Compiling the Votes of a Subelectorate 550: Preference Learning with Extreme Examples 553: Planning Games 564: Control-based clause sharing in parallel SAT solving 569: Balancing Utility and Deal Probability for Negotiations in Highly Nonlinear Utility Spaces 577: Simultaneous Discovery of Conservation Laws and Hidden Particles with Smith Matrix Decomposition 579: Boosting constrained mutual subspace method for robust image-set based object recognition 582: Maximum Margin Multiple Instance Clustering 584: Combining RCC-8 with Qualitative Direction Calculi: Algorithms and Complexity| 590: Efficient Estimation of Influence Functions for SIS Model on Social Networks 593: UCT for Tactical Assault Planning in Real-Time Strategy Games 595: Graph Embedding with Constraints 597: Semi-supervised Classification on Evolutionary Data 598: Bayesian Extreme Components Analysis 605: Multi-Way Number Partitioning 610: Large Margin Boltzmann Machines 614: Testing Edges by Truncations 626: Tractable Multi-Agent Path Planning on Grid Maps 640: Spectral Embedded Clustering 641: Bootstrap Voting Experts 642: A Divide-and-Conquer Approach for Solving Interval Algebra Networks 644: Online Stochastic Optimization in the Large: Application to Kidney Exchange 653: Semi-supervised Classification using Sparse Gaussian Process Regression 659: Decentralized Planning with Temporally Extended Goals and Uncontrollable Events 667: Learning HTN Method Preconditions and Action Models from Partial Observations 670: A Sparse Covariance Function for Exact Gaussian Process Inference in Large Datasets 671: Discriminative Semi-supervised Feature Selection via Manifold Regularization 676: Computing equilibria in multiplayer stochastic games 678: Locality Preserving Nonnegative Matrix Factorization 682: Adaptive Cluster Ensemble Selection 686: Semi-supervised Regression for Evaluating Convenience Store Location 696: Exponential Family Sparse Coding with Application to Self-taught Learning 697: Towards Ontology Learning from Folksonomies 709: Investigations of Continual Computation 718: Improving Morphology Induction by Learning Spelling Rules 722: DL-liteR in the Light of Propositional Logic for Decentralized Data Management 732: Defeasible inclusions in low-complexity DLs: Preliminary notes 739: K-Swaps: Cooperative Negotiation for Solving Task-Allocation Problems 749: Composition of ConGolog Programs 759: Conjunctive Query Answering in EL using a Relational Database System 766: Charting the Tractability Frontier of Mixed Multi-Unit Combinatorial Auctions 786: Anytime Coalition Structure Generation in Partition Function Games 789: A Syntax-based Framework for Merging Imprecise Probabilistic Logic Programs 791: Generalised Fictitious Play for a Continuum of Anonymous Players 792: An axiomatic account of preference-based argumentation systems 805: Experiments with Massively Parallel Constraint Solving 806: Collaborative Multi Agent Physical Search with Probabilistic Knowledge 811: On the Complexity of Compact Coalitional Games 817: Computational Semantics of Noun Compounds in a Semantic Space Model 824: Multi-step Multi-sensor Hider-Seeker Games 827: Towards Context Aware Emotional Intelligence in Machines: Computing Contextual Appropriateness of A 828: Search Strategies for an Anytime Usage of the Branch and Prune Algorithm 839: Inverse Reinforcement Learning in Partially Observable Environments 841: Knowledge Compilation Properties of Trees-of-BDDs, Revisited 853: Automated Theorem Proving for General Game Playing 857: FRACTAL: Efficient Fault Isolation Using Active Testing 863: Fast Recommendations using GAI Models 870: Multiobjective optimization using GAI models 878: Local Query Mining in a Probabilistic Prolog 883: Generalized Clustergrams for Overlapping Biclusters 889: Spatial Processes for Recommender Systems 902: The complexity of learning separable ceteris paribus preferences 903: Optimal Symbolic Planning with Action Costs and Preferences 916: Towards Efficient Consistency Enforcement for Global Constraints in Weighted Constraint Satisfaction 919: Reading Between the Lines 920: Nominals for Everyone 921: Situated Resolution and Generation of Spatial Referring Expressions for Robotic Assistants 927: Context-Based Approach for Pivot Translation 928: Context-Sensitive Semantic Smoothing using Semantically Relatable Sequences 936: A Computational Model for the Alignment of Hierarchical Scene Representations in Human-Robot Interac 948: Decentralised Coordination of Mobile Sensors Using the Max-Sum Algorithm 951: Maintaining Predictions Over Time Without a Model 953: Efficient Reasoning with Knowledge, Action and Time in Dynamic and Uncertain Domains 956: Open Extensible Global Constraints 958: Self-supervised aerial image analysis for extracting parking lot structures 965: Transfer Learning from Minimal Target Data by Mapping across Relational Domains 966: Qualitative CSP, finite CSP, and SAT: Comparing methods for qualitative constraint-based reasoning 967: Flexible Procurement of Services with Uncertain Durations 971: Structured Plans and Observation Reduction for Plans with Contexts 972: Dynamic Configuration of Agent Organizations 976: A Logic for Coalitions with Bounded Resources 986: Angluin-Style Learning of NFA 989: Solving Strong-Fault Diagnostic Models by Model Relaxation 996: Dynamic selection of ontological alignments: a space reduction mechanism 1000: Eliciting Honest Reputation Feedback in a Markov Setting 1003: Plan Recognition as Planning 1007: A Distributed Control Loop for Autonomous Recovery in a Multi-Agent Plan 1008: Knowing More -- from Global to Local Correspondence 1012: HTN Planning with Preferences 1023: Multi-Class Classifiers and Their Underlying Shared Structure 1025: Iterated Regret Minimization: A New Solution Concept 1026: Learning the Optimal Neighborhood Kernel for Classification 1030: Temporal planning in domains with linear processes 1033: Commitment Tracking via the Reactive Event Calculus 1039: Exponential Family Hybrid Semi-Supervised Learning 1041: Efficient Abstraction and Refinement for Behavioral Description Based Web Service Composition 1045: A logic for reasoning about counterfactual emotions 1047: Detection of Imperative and Declarative Question-Answer Pairs in Email Conversations 1052: Learning a Value Analysis Tool For Agent Evaluation 1055: A* Search with Inconsistent Heuristics 1057: Robust Distance Metric Learning with Auxiliary Knowledge 1076: Multi-Relational Learning with Gaussian Processes 1083: Learning Kinematic Models for Articulated Objects 1084: On Solving Boolean Multilevel Optimization Problems 1085: A Context Driven Approach for Workflow Mining 1086: A Semantical Account of Progression in the Presence of Defaults 1094: Bidirectional Answer Set Programs with Function Symbols 1115: {Expressive Melody Synthesis with the Theremin 1116: Learning Probabilistic Hierarchical Task Networks to Capture User Preferences 1123: Web-Scale N-gram Models for Lexical Disambiguation 1139: Notions of State Equivalence under Partial Observability 1144: Query Answering in Description Logics with Transitive Roles 1148: Applications and Extensions of PTIME Description Logics with Functional Constraints 1151: Interruptible algorithms for Multi-Problem Solving 1157: Exploiting Decomposition on Constraint Problems with High Tree-Width 1159: Set Branching in Constraint Optimization 1163: Mixing Search Strategies for Multi-Player Games 1166: Transfer Learning using Task-Level Features with Application to Information Retrieval 1167: Online Graph Planarisation for Synchronous Parsing of Semantic and Syntactic Dependencies 1174: TBA*: Time-Bounded A* 1177: Topological Order Planner for POMDPs 1178: Explicit vs. Latent Concept Models for Cross-Language Information Retrieval 1179: Streamed Learning: One-Pass SVMs 1180: Declarative Programming of Search Problems with Built-in Arithmetic 1181: Suggesting Email View Filters for Triage and Search 1184: Minimum Proof Graphs and Fastest-Cut-First Search Heuristics 1191: Ceteris Paribus Preference Elicitation with Predictive Guarantees 1193: Unsupervised Rank Aggregation with Domain-Specific Expertise 1199: Regular Path Queries in Expressive Description Logics with Nominals 1201: Speeding Up Exact Solutions of Interactive Dynamic Influence Diagrams Using Action Equivalence 1205: Search Techniques for Fourier-Based Learning 1218: Adversarial Uncertainty in Multi-Robot Patrol 1233: Improving State Evaluation, Inference, and Search in Trick-Based Card Games 1239: Learning Hierarchical Task Networks for Nondeterministic Planning Domains 1243: Effective Query Rewriting with Ontologies over DBoxes 1247: Translating HTNs to PDDL: A Small Amount of Domain Knowledge Can Go a Long Way 1250: Streamlining Attacks on CAPTCHAs with a Computer Game 1252: Autonomously Learning an Action Hierarchy Using a Learned Qualitative State Representation 1253: Lifted Aggregation in Directed First-order Probabilistic Models 1256: On the Equivalence Between Canonical Correlation Analysis and Orthonormalized Partial Least Squares 1266: Using Entropy to differentiate between shape and text in hand drawn diagrams 1267: Import-by-Query: Ontology Reasoning under Access Limitations 1276: ReTrASE: Integrating Paradigms for Approximate Probabilistic Planning 1277: Towards Con-resistant Trust Models for Distributed Agent Systems 1278: A Tableaux-based Method for Computing Least Common Subsumers for Expressive Description Logics 1281: Probabilistic Counting with Randomized Storage 1286: On Combinations of Binary Qualitative Constraint Calculi 1287: Identifying a Class of Linear Models 1291: gRegress: Extracting Features from Graph Transactions for Regression 1298: Extended First Order Decision Diagrams for First Order Markov Decision Processes 1305: Activity Recognition with Intended Actions 1307: Finite Local Consistency Characterizes Generalized Scoring Rules 1311: Monte-Carlo Exploration for Deterministic Planning 1312: A Visual Approach to Sketched Symbol Recognition 1323: Combining Breadth-First and Depth-First Strategies in Searching for Treewidth 1333: Diagnosing Multiple Persistent and Intermittent Faults 1340: On First-Order Definability and Computability of Progression for Local-Effect Actions and Beyond 1352: Planning with Partial Preference Models 1354: Information-Lookahead Planning for AUV Mapping 1361: Improving a Virtual Human Using a Model of Degrees of Grounding 1362: Efficient Online Learning and Prediction of Users' Desktop Commands 1366: A New d-DNNF-Based Bound Computation Algorithm for Functional EMAJSAT 1368: Large-Scale Taxonomy Mapping for Restructuring and Integrating Wikipedia 1375: Human Activity Encoding and Recognition Using Low-level Visual Features 1376: Consequence-Driven Reasoning for Deterministic SHIQ Ontologies 1384: Discovering Theorems in Game Theory: Two-Person Games with Unique Nash Equilibria Payoffs 1397: Domain Independent Automatic Partition for MDPs 1403: Nonmyopic Adaptive Informative Path Planning for Multiple Robots 1405: A Kernel Method for Market Clearing 1409: Combining Speech and Sketch to Interpret Unconstrained Descriptions of Mechanical Devices 1410: SATenstein: Automatically Building Local Search SAT Solvers From Components 1412: A Multi-Agent Learning Approach to Online Distributed Resource Allocation 1414: Learning Graphical Game Models 1422: Inferring semantic distances between concepts using an online game 1427: Interpreting Written How-to Instructions 1433: Toward Unsupervised Activity Monitoring 1453: Multiclass Probabilistic Kernel Discriminant Analysis 1467: Exploiting Background Knowledge to Build Reference Sets for Information Extraction 1478: Semi-Supervised Learning of Visual Classifiers from Web Images and Text 1499: Multi-Source Omni-View Cooperative Learning 1507: Duplicate Avoidance in Depth-First Search with Applications to Treewidth 1512: Drosophila Gene Expression Pattern Annotation Through Multi-Instance Multi-Label Learning 1514: Relational Random Forests based on Random Relational Rules 1519: Strengthening Schedules Through Uncertainty Analysis 1522: Knowledge Transfer on Hybrid Graph 1524: Domain-Informed Novelty Detection for Autonomous Exploration 1527: Acquiring Agent-Based Models of Conflict from Event Data 1528: Methodology for Designing Reasonably Expressive Mechanisms with Application to Ad Auctions 1529: Integrating Systematic and Local Search Paradigms: A New Strategy for MAX-SAT 1536: Efficient Computation of Jointree Bounds for Systematic MAP Search 1546: Non-metric Label Propagation 1555: Speeding Up Inference in MLNs by Preprocessing to Reduce the Size of the Resulting Grounded Network 1577: Word Sense Disambiguation for All Words Without Hard Labor 1588: A Content-Based Method to Enhance Tag Recommendation 1593: Variety Reasoning for Multiset Constraint Propagation 1601: A fixed-parameter tractable algorithm for spatio-temporal calendar management 1611: Preferences, Mechanisms, and Collaboration in Transportation: The ABC of Ridesharing 1640: An Unified Framework for Dialectical Proof Procedures in Argumentation 1642: Russian Doll Search with Tree Decomposition 1658: Exploiting Multi-Modal Interactions: A Unified Framework 1677: Plausible Repairs for Inconsistent Requirements 1680: Incorporating User Behaviors in New Word Detection 1683: Probabilistic Models for Concurrent Chatting Activity Recognition Southern California is a home to the aerospace and entertainment industries Site last updated on 4/15/2009
|
-- 作者:viaphone -- 发布时间:4/20/2009 8:59:00 PM -- 咋没有学校和国家信息... |
-- 作者:windking8888 -- 发布时间:4/25/2009 12:31:00 AM -- 暂时还没有公布,可能需要过一段时间 这次中国人比较多,值得庆祝 |
-- 作者:whfcarter -- 发布时间:4/30/2009 11:39:00 PM -- 满眼都是中国人,值得祝贺。这也说明中国人发顶级会议不是梦想,继续努力,做更好的更有影响力的研究,而不仅仅满足于发文章。 |
-- 作者:Humphrey -- 发布时间:5/1/2009 11:16:00 AM -- 是啊,好多国外数据库中收录的文章也都是国人所作。我曾经在IEEE等数据库中检索过,咱们国家的同志发表的文章很多啊,而且时间也多为近期的。 |
-- 作者:windking8888 -- 发布时间:5/1/2009 1:10:00 PM -- 尽管很多优秀的成果都是中国人在国外取得,但是国人的勤奋和认真,是任何人无法比的。 随着中国综合实力增强,科技肯定会变得越来越壮大。
|
W 3 C h i n a ( since 2003 ) 旗 下 站 点 苏ICP备05006046号《全国人大常委会关于维护互联网安全的决定》《计算机信息网络国际联网安全保护管理办法》 |
156.250ms |