IJCAI 2001 - PDF Preprint Papers

IJCAI 2001

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IJCAI-2001 Paper

click to vote

IJCAI
2001

215views Artificial Intelligence» more IJCAI 2001»

Real-Time Auditory and Visual Multiple-Object Tracking for Humanoids

13 years 5 months ago

Download winnie.kuis.kyoto-u.ac.jp

This paper presents a real-time auditory and visual tracking of multiple objects for humanoid under real-world environments. Real-time processing is crucial for sensorimotor tasks...

Kazuhiro Nakadai, Ken-ichi Hidai, Hiroshi Mizoguch...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	215	Real-Time Auditory and Visual Multiple-Object Tracking for Humanoids	claim
2	185	Symbolic Dynamic Programming for First-Order MDPs	claim
3	183	Active Learning for Class Probability Estimation and Ranking	claim
4	174	Complexity of Probabilistic Planning under Average Rewards	claim
5	172	Mining Soft-Matching Rules from Textual Data	claim
6	170	Keyword Spices: A New Method for Building Domain-Specific Web Search Engines	claim
7	166	Agent-Human Interactions in the Continuous Double Auction	claim
8	166	Automatically Extracting and Comparing Lexicalized Grammars for Different Languages	claim
9	163	Exploiting Multiple Secondary Reinforcers in Policy Gradient Reinforcement Learning	claim
10	163	Probabilistic Classification and Clustering in Relational Data	claim
11	160	CAST: Collaborative Agents for Simulating Teamwork	claim
12	159	CABOB: A Fast Optimal Algorithm for Combinatorial Auctions	claim
13	155	Acquiring Conceptual Relationships from Domain-Specific Texts	claim
14	151	R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning	claim
15	148	Executing Reactive, Model-based Programs through Graph-based Temporal Planning	claim
16	142	An Improved Grid-Based Approximation Algorithm for POMDPs	claim
17	141	Robot Weightlifting By Direct Policy Search	claim
18	140	Causal interaction: from a high-level representation to an operational event-based representation	claim
19	140	Ontology Reasoning in the SHOQ(D) Description Logic	claim
20	140	Acquisition of Ontological Knowledge from Canonical Documents	claim
21	139	A Comparative Study of Logic Programs with Preference	claim
22	134	Integrating Expectations from Different Sources to Help End Users Acquire Procedural Knowledge	claim
23	134	Narrative Prose Generation	claim
24	134	Total-Order Planning with Partially Ordered Subtasks	claim
25	134	Approximate inference for first-order probabilistic languages	claim
26	129	High Performance Reasoning with Very Large Knowledge Bases: A Practical Case Study	claim
27	128	Qualitative Simulation of Genetic Regulatory Networks: Method and Application	claim
28	125	Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas	claim
29	125	Solving Non-Boolean Satisfiability Problems with Stochastic Local Search	claim
30	125	Dynamic Control Of Plans With Temporal Uncertainty	claim
31	125	Active Learning for Structure in Bayesian Networks	claim
32	123	A backbone-search heuristic for efficient solving of hard 3-SAT formulae	claim
33	123	Genetic Algorithm based Selective Neural Network Ensemble	claim
34	122	Planning with Resources and Concurrency: A Forward Chaining Approach	claim
35	122	Bidding Languages for Combinatorial Auctions	claim
36	122	An Empirical Study of the Influence of User Tailoring on Evaluative Argument Effectiveness	claim
37	122	Title Generation for Machine-Translated Documents	claim
38	120	On-Line Execution of cc-Golog Plans	claim
39	120	Constraints as Data: A New Perspective on Inferring Probabilities	claim
40	120	Balance and Filtering in Structured Satisfiable Problems	claim
41	120	Knowledge Extraction from Local Function Networks	claim
42	119	Learning Iterative Image Reconstruction	claim
43	119	Rational and Convergent Learning in Stochastic Games	claim
44	118	A Constraint Satisfaction Approach to Parametric Differential Equations	claim
45	118	Planning as Model Checking for Extended Goals in Non-deterministic Domains	claim
46	118	Neural Logic Network Learning using Genetic Programming	claim
47	117	An Agent Architecture for Multi-Attribute Negotiation	claim
48	116	Computational Complexity of Planning with Temporal Goals	claim
49	115	Adaptive Control of Acyclic Progressive Processing Task Structures	claim
50	115	Achieving Budget-Balance with Vickrey-Based Payment Schemes in Exchanges	claim
51	115	Distributed Monitoring of Hybrid Systems: A model-directed approach	claim
52	114	Refining the Structure of a Stochastic Context-Free Grammar	claim
53	113	Combining Statistics and Semantics for Word and Document Clustering	claim
54	112	Learning Procedural Knowledge to Better Coordinate	claim
55	112	Discriminating Animate from Inanimate Visual Stimuli	claim
56	111	Modularity and Design in Reactive Intelligence	claim
57	111	Heterogeneity in the Coevolved Behaviors of Mobile Robots: The Emergence of Specialists	claim
58	110	Adaptive Information Extraction from Text by Rule Induction and Generalisation	claim
59	110	Temporal Decision Trees or the lazy ECU vindicated	claim
60	110	Backjumping for Quantified Boolean Logic Satisfiability	claim
61	110	Causality and Minimal Change Demystified	claim
62	110	Efficient Consequence Finding	claim
63	108	Graph Theoretical Characterization and Computation of Answer Sets	claim
64	108	Search on High Degree Graphs	claim
65	107	Refining the Basic Constraint Propagation Algorithm	claim
66	106	Behavior Planning for a Reflexive Agent	claim
67	106	Perceptual Anchoring of Symbols for Action	claim
68	106	Decision Procedures for Expressive Description Logics with Intersection, Composition, Converse of Roles and Role Identity	claim
69	105	From Images to Bodies: Modelling and Exploiting Spatial Occlusion and Motion Parallax	claim
70	105	Market Clearability	claim
71	104	Generating Tailored Examples to Support Learning via Self-explanation	claim
72	104	Causes and Explanations: A Structural-Model Approach - Part II: Explanations	claim
73	104	Using Case-Base Data to Learn Adaptation Knowledge for Design	claim
74	103	Representing Sentence Structure in Hidden Markov Models for Information Extraction	claim
75	102	Usability Guidelines for Interactive Search in Direct Manipulation Systems	claim
76	102	Leveraging Data About Users in General in the Learning of Individual User Models	claim
77	102	The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding	claim
78	101	Minimizing Dialog Length in Interactive Case-Based Reasoning	claim
79	100	Formalizing Artistic Techniques and Scientific Visualization for Painted Renditions of Complex Information Spaces	claim
80	99	A Perspective on Knowledge Compilation	claim
81	99	Multi-Agent Influence Diagrams for Representing and Solving Games	claim
82	99	Backbones in Optimization and Approximation	claim
83	97	Fair Imposition	claim
84	97	Bundle Design in Robust Combinatorial Auction Protocol against False-name Bids	claim
85	96	IBAL: A Probabilistic Rational Programming Language	claim
86	95	Local Search Topology in Planning Benchmarks: An Empirical Analysis	claim
87	95	The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming	claim
88	95	Making AC-3 an Optimal Algorithm	claim
89	94	Multimodal Integration A Biological View	claim
90	94	Mode Estimation of Model-based Programs: Monitoring Systems with Complex Behavior	claim
91	93	Preference-Based Configuration of Web Page Content	claim
92	93	Link Analysis, Eigenvectors and Stability	claim
93	93	An On-line Decision-Theoretic Golog Interpreter	claim
94	92	Backtracking Through Biconnected Components of a Constraint Graph	claim
95	92	Visual Analogy in Problem Solving	claim
96	92	Efficient Interpretation Policies	claim
97	92	Using Text Classifiers for Numerical Classification	claim
98	91	Relational Learning via Propositional Algorithms: An Information Extraction Case Study	claim
99	91	Grounded Models as a Basis for Intuitive Reasoning	claim
100	90	Weakening Conflicting Information for Iterated Revision and Knowledge Integration	claim
101	90	Context-specific Sign-propagation in Qualitative Probabilistic Networks	claim
102	90	Incomplete Tree Search using Adaptive Probing	claim
103	89	Rule Induction for Concept Hierarchy Alignment	claim
104	89	Knowledge Analysis on Process Models	claim
105	88	Reviving Partial Order Planning	claim
106	87	Adaptive Web Navigation for Wireless Devices	claim
107	87	A software architecture for dynamically generated adaptive Web stores	claim
108	87	Reasoning about Categories in Conceptual Spaces	claim
109	85	Using Information Extraction Rules for Extending Domain Ontologies	claim
110	84	A Framework for Declarative Update Specifications in Logic Programs	claim
111	84	Reinforcement Learning in Distributed Domains: Beyond Team Games	claim
112	82	Dealing with Dependencies between Content Planning and Surface Realisation in a Pipeline Generation Architecture	claim
113	82	Knowledge Processing under Information Fidelity	claim
114	81	A Simple Additive Re-weighting Strategy for Improving Margins	claim
115	81	Solving Factored MDPs via Non-Homogeneous Partitioning	claim
116	81	On Market-Inspired Approaches to Propositional Satisfiability	claim
117	79	Learning Relations Using Collocations	claim
118	79	Reflective Negotiating Agents for Real-Time Multisensor Target Tracking	claim
119	78	Resolving Ambiguities to Create a Natural Computer-Based Sketching Environment	claim
120	78	A Layered Brain Architecture for Synthetic Creatures	claim
121	77	The Foundations of Cost-Sensitive Learning	claim
122	77	Temporal Constraint Reasoning With Preferences	claim
123	76	Bridging the Lesson Distribution Gap	claim
124	76	Violation-Guided Learning for Constrained Formulations in Neural-Network Time-Series Predictions	claim
125	75	Multi-Agent Systems by Incremental Gradient Reinforcement Learning	claim
126	75	Template Driven Information Extraction for Populating Ontologies	claim
127	75	Robust Multi-unit Auction Protocol against False-name Bids	claim
128	73	Plausibility Measures: A General Approach For Representing Uncertainty	claim
129	72	SiN: Integrating Case-based Reasoning with Task Decomposition	claim
130	71	Knowledge Acquisition for Knowledge Management	claim
131	71	Heuristic Search in Infinite State Spaces Guided by Lyapunov Analysis	claim
132	70	Robust Translation of Spontaneous Speech: A Multi-Engine Approach	claim
133	69	Max-norm Projections for Factored MDPs	claim
134	66	Identification Constraints and Functional Dependencies in Description Logics	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers