IJCAI 2007 - PDF Preprint Papers

IJCAI 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IJCAI-2007 Paper

click to vote

IJCAI
2007

294views Artificial Intelligence» more IJCAI 2007»

Fast Image Alignment Using Anytime Algorithms

14 years 26 days ago

Download www.ijcai.org

Image alignment refers to ﬁnding the best transformation from a ﬁxed reference image to a new image of a scene. This process is often guided by similarity measures between ima...

Rupert Brooks, Tal Arbel, Doina Precup

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	294	Fast Image Alignment Using Anytime Algorithms	claim
2	280	Automated Heart Wall Motion Abnormality Detection from Ultrasound Images Using Bayesian Networks	claim
3	275	Effective Control Knowledge Transfer through Learning Skill and Representation Hierarchies	claim
4	271	Adaptive Genetic Algorithm with Mutation and Crossover Matrices	claim
5	271	Integration of Hybrid Bio-Ontologies using Bayesian Networks for Knowledge Discovery	claim
6	267	ItemRank: A Random-Walk Based Scoring Algorithm for Recommender Engines	claim
7	263	Depth Estimation Using Monocular and Stereo Cues	claim
8	263	Common Sense Based Joint Training of Human Activity Recognizers	claim
9	262	Emergence of Norms through Social Learning	claim
10	254	Bayesian Inverse Reinforcement Learning	claim
11	253	Collapsed Variational Dirichlet Process Mixture Models	claim
12	251	Automatically Selecting Answer Templates to Respond to Customer Emails	claim
13	251	Document Summarization Using Conditional Random Fields	claim
14	248	Transfer Learning in Real-Time Strategy Games Using Hybrid CBR/RL	claim
15	239	IJCAI Organization	claim
16	238	A Convengent Solution to Tensor Subspace Learning	claim
17	237	WiFi-SLAM Using Gaussian Process Latent Variable Models	claim
18	237	Coordination to Avoid Starvation of Bottleneck Agents in a Large Network System	claim
19	232	Exploiting Image Contents in Web Search	claim
20	228	Extracting Keyphrases to Represent Relations in Social Networks from Web	claim
21	227	Web Page Clustering Using Heuristic Search in the Web Graph	claim
22	227	A Scalable Kernel-Based Algorithm for Semi-Supervised Metric Learning	claim
23	227	Conjunctive Query Answering for the Description Logic SHIQ	claim
24	225	On the Automatic Scoring of Handwritten Essays	claim
25	225	Constraint Partitioning for Solving Planning Problems with Trajectory Constraints and Goal Preferences	claim
26	224	Computing Semantic Relatedness Using Wikipedia-based Explicit Semantic Analysis	claim
27	224	Identifying Expressions of Opinion in Context	claim
28	223	Automatic Gait Optimization with Gaussian Process Regression	claim
29	223	Detection of Cognitive States from fMRI Data Using Machine Learning Techniques	claim
30	223	Relational Knowledge with Predictive State Representations	claim
31	222	Learning to Walk through Imitation	claim
32	221	Graph-Based Semi-Supervised Learning as a Generative Model	claim
33	218	Augmented Experiment: Participatory Design with Multiagent Simulation	claim
34	217	Semantic Precision and Recall for Ontology Alignment Evaluation	claim
35	217	Coalitional Bargaining with Agent Type Uncertainty	claim
36	215	A Theoretical Framework for Learning Bayesian Networks with Parameter Inequality Constraints	claim
37	215	Detecting Changes in Unlabeled Data Streams Using Martingale	claim
38	213	Optimal Soft Arc Consistency	claim
39	213	Case-Based Techniques Used for Dialogue Understanding and Planning in a Human-Robot Dialogue System	claim
40	212	Hybrid Elections Broaden Complexity-Theoretic Resistance to Control	claim
41	212	Bayesian Tensor Inference for Sketch-Based Facial Photo Hallucination	claim
42	212	Semantic Smoothing of Document Models for Agglomerative Clustering	claim
43	209	Logistic Regression Models for a Fast CBIR Method Based on Feature Selection	claim
44	206	Computational Aspects of Analyzing Social Network Dynamics	claim
45	205	Emotions as Durative Dynamic State for Action Selection	claim
46	205	Locality Sensitive Discriminant Analysis	claim
47	205	Coalitions in Action Logic	claim
48	204	Completing Description Logic Knowledge Bases Using Formal Concept Analysis	claim
49	202	Color Learning on a Mobile Robot: Towards Full Autonomy under Changing Illumination	claim
50	202	Tractable Temporal Reasoning	claim
51	201	A Size-Based Qualitative Approach to the Representation of Spatial Granularity	claim
52	201	Building Structure into Local Search for SAT	claim
53	201	Using Linear Programming for Bayesian Exploration in Markov Decision Processes	claim
54	200	Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-Suppressed BDDs	claim
55	200	RoxyBot-06: An (SAA)2 TAC Travel Agent	claim
56	200	Analogical Learning in a Turn-Based Strategy Game	claim
57	200	From Answer Set Logic Programming to Circumscription via Logic of GK	claim
58	198	A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios	claim
59	198	A Decision-Theoretic Model of Assistance	claim
60	196	Concept Sampling: Towards Systematic Selection in Large-Scale Mixed Concepts in Machine Learning	claim
61	195	Edge Partitioning in External-Memory Graph Search	claim
62	195	Fault-Model-Based Test Generation for Embedded Software	claim
63	194	Occam's Razor Just Got Sharper	claim
64	194	The Design of ESSENCE: A Constraint Language for Specifying Combinatorial Problems	claim
65	194	Market Based Resource Allocation with Incomplete Information	claim
66	194	MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization	claim
67	194	Average-Reward Decentralized Markov Decision Processes	claim
68	192	Transferring Learned Control-Knowledge between Planners	claim
69	191	Change of Representation for Statistical Relational Learning	claim
70	191	Multi-Agent System that Attains Longevity via Death	claim
71	190	A New Perspective on Stable Models	claim
72	190	Privacy and Artificial Agents, or, Is Google Reading My Email?	claim
73	189	Lambda Depth-First Proof Number Search and Its Application to Go	claim
74	189	A Hybrid Ontology Directed Feedback Selection Algorithm for Supporting Creative Problem Solving Dialogues	claim
75	189	Multipotential Games	claim
76	189	Communicating Effectively in Resource-Constrained Multi-Agent Systems	claim
77	189	A Bayesian Computational Cognitive Model	claim
78	188	IJCAI-07 Keynote and Invited Speakers	claim
79	188	Prediction of Probability of Survival in Critically Ill Patients Optimizing the Area under the ROC Curve	claim
80	188	Inferring Long-term User Properties Based on Users' Location History	claim
81	188	Computation of Initial Modes for K-modes Clustering Algorithm Using Evidence Accumulation	claim
82	187	Forward Search Value Iteration for POMDPs	claim
83	187	Compiling Bayesian Networks Using Variable Elimination	claim
84	187	A Framework for Decentralized Qualitative Model-Based Diagnosis	claim
85	186	Mediating between Qualitative and Quantitative Representations for Task-Orientated Human-Robot Interaction	claim
86	186	Online Speed Adaptation Using Supervised Learning for High-Speed, Off-Road Autonomous Driving	claim
87	186	Automated Design of Multistage Mechanisms	claim
88	185	Robust Object Tracking with a Case-Base Updating Strategy	claim
89	185	Feature Based Occupancy Grid Maps for Sonar Based Safe-Mapping	claim
90	185	Open Information Extraction from the Web	claim
91	184	Incremental Learning of Perceptual Categories for Open-Domain Sketch Recognition	claim
92	184	A Fully Connectionist Model Generator for Covered First-Order Logic Programs	claim
93	184	Argumentation Based Contract Monitoring in Uncertain Domains	claim
94	184	Constructing New and Better Evaluation Measures for Machine Learning	claim
95	184	All Common Subsequences	claim
96	183	Managing Domain Knowledge and Multiple Models with Boosting	claim
97	183	Conflict Directed Backjumping for Max-CSPs	claim
98	183	AWA* - A Window Constrained Anytime Heuristic Search Algorithm	claim
99	182	A Fast Analytical Algorithm for Solving Markov Decision Processes with Real-Valued Resources	claim
100	182	Inferring Complex Agent Motions from Partial Trajectory Observations	claim
101	182	Learning to Identify Unexpected Instances in the Test Set	claim
102	182	A Labeling Approach to the Computation of Credulous Acceptance in Argumentation	claim
103	182	What You Seek Is What You Get: Extraction of Class Attributes from Query Logs	claim
104	182	Winner Determination in Sequential Majority Voting	claim
105	181	An Information-Theoretic Analysis of Memory Bounds in a Distributed Resource Allocation Mechanism	claim
106	180	Explanation-Based Feature Construction	claim
107	180	Dynamically Weighted Hidden Markov Model for Spam Deobfuscation	claim
108	180	Graph Decomposition for Efficient Multi-Robot Path Planning	claim
109	180	An Analysis of the Use of Tags in a Blog Recommender System	claim
110	179	Graph Connectivity Measures for Unsupervised Word Sense Disambiguation	claim
111	179	Deictic Option Schemas	claim
112	179	A General Framework for Reasoning about Inconsistency	claim
113	179	Heuristic Selection of Actions in Multiagent Reinforcement Learning	claim
114	179	A Heuristic Search Approach to Planning with Temporally Extended Preferences	claim
115	177	A Factor Graph Model for Software Bug Finding	claim
116	177	Fast Incremental Square Root Information Smoothing	claim
117	176	Counting Complexity of Propositional Abduction	claim
118	176	Opponent Modeling in Scrabble	claim
119	176	ProbLog: A Probabilistic Prolog and Its Application in Link Discovery	claim
120	176	Gossip-Based Aggregation of Trust in Decentralized Reputation Systems	claim
121	176	Metric Properties of Structured Data Visualizations through Generative Probabilistic Modeling	claim
122	175	A Predictive Approach to Help-Desk Response Generation	claim
123	175	An Experts Algorithm for Transfer Learning	claim
124	174	Arc Consistency during Search	claim
125	173	Maximum Margin Coresets for Active and Noise Tolerant Learning	claim
126	173	Reinforcement Learning of Local Shape in the Game of Go	claim
127	173	Learning Policies for Embodied Virtual Agents through Demonstration	claim
128	173	Automatic Acquisition of Context-Specific Lexical Paraphrases	claim
129	173	On Mining Closed Sets in Multi-Relational Data	claim
130	173	Learning "Forgiving" Hash Functions: Algorithms and Large Scale Tests	claim
131	173	When is Temporal Planning Really Temporal?	claim
132	172	A Logical Framework for Modularity of Ontologies	claim
133	172	Optimistic Active-Learning Using Mutual Information	claim
134	172	Conservative Extensions in Expressive Description Logics	claim
135	172	Automatic Synthesis of New Behaviors from a Library of Available Behaviors	claim
136	172	Surprise as Shortcut for Anticipation: Clustering Mental States in Reasoning	claim
137	172	Automated Benchmark Model Generators for Model-Based Diagnostic Inference	claim
138	171	The Fringe-Saving A* Search Algorithm - A Feasibility Study	claim
139	171	Ensembles of Partially Trained SVMs with Multiplicative Updates	claim
140	170	Cooperating Reasoning Processes: More than Just the Sum of Their Parts	claim
141	170	First Order Decision Diagrams for Relational MDPs	claim
142	170	General Game Learning Using Knowledge Transfer	claim
143	170	Memory-Bounded Dynamic Programming for DEC-POMDPs	claim
144	170	State Space Search for Risk-Averse Agents	claim
145	170	Opinion Sentence Search Engine on Open-Domain Blog	claim
146	169	Improving Embeddings by Flexible Exploitation of Side Information	claim
147	169	Progression of Situation Calculus Action Theories with Incomplete Information	claim
148	169	Estimating the Rate of Web Page Updates	claim
149	169	On Natural Language Processing and Plan Recognition	claim
150	169	A Comparison of Time-Space Schemes for Graphical Models	claim
151	169	Spiteful Bidding in Sealed-Bid Auctions	claim
152	169	Towards an Integration of Golog and Planning	claim
153	169	Domain Independent Approaches for Finding Diverse Plans	claim
154	169	Combining Learning and Word Sense Disambiguation for Intelligent User Profiling	claim
155	168	Mechanism Design with Partial Revelation	claim
156	168	One Class per Named Entity: Exploiting Unlabeled Text for Named Entity Recognition	claim
157	168	Towards Reasoning about the Past in Neural-symbolic Systems	claim
158	167	Layout Analysis of Tree-Structured Scene Frames in Comic Images	claim
159	167	Nogood Recording from Restarts	claim
160	166	Decidable Reasoning in a Modified Situation Calculus	claim
161	166	Robust Human-Computer Interaction System Guiding a User by Providing Feedback	claim
162	166	Detect and Track Latent Factors with Online Nonnegative Matrix Factorization	claim
163	166	Learning to Count by Think Aloud Imitation	claim
164	166	Incremental Mechanism Design	claim
165	166	Incremental Construction of Structured Hidden Markov Models	claim
166	166	Parametric Kernels for Sequence Data Analysis	claim
167	165	Learning Semantic Descriptions of Web Information Sources	claim
168	165	Vote and Aggregation in Combinatorial Domains with Structured Preferences	claim
169	165	Formalizing Communication Protocols for Multiagent Systems	claim
170	165	Representations for Action Selection Learning from Real-Time Observation of Task Experts	claim
171	164	Reaching Envy-Free States in Distributed Negotiation Settings	claim
172	164	Is the Turing Test Good Enough? The Fallacy of Resource-Unbounded Intelligence	claim
173	164	Extracting Chatbot Knowledge from Online Discussion Forums	claim
174	164	An Improved Probabilistic Ant based Clustering for Distributed Databases	claim
175	164	Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control	claim
176	164	A Faithful Integration of Description Logics with Logic Programming	claim
177	163	A Subspace Kernel for Nonlinear Feature Extraction	claim
178	163	A Multi-Agent Medical System for Indian Rural Infant and Child Care	claim
179	162	Grounding Abstractions in Predictive State Representations	claim
180	162	A Description Logic of Change	claim
181	162	Improving Anytime Point-Based Value Iteration Using Principled Point Selections	claim
182	161	The Effect of Restarts on the Efficiency of Clause Learning	claim
183	161	Probabilistic Consistency Boosts MAC and SAC	claim
184	161	Sharing the Road: Autonomous Vehicles Meet Human Drivers	claim
185	161	Simple Training of Dependency Parsers via Structured Boosting	claim
186	161	Training Conditional Random Fields Using Virtual Evidence Boosting	claim
187	161	Planning with Goal Utility Dependencies	claim
188	161	Extracting Propositional Rules from Feed-forward Neural Networks - A New Decompositional Approach	claim
189	160	Iterated Weaker-than-Weak Dominance	claim
190	160	Learning from Partial Observations	claim
191	160	MESH-Based Active Monte Carlo Recognition (MESH-AMCR)	claim
192	159	A Machine Learning Approach for Statistical Software Testing	claim
193	158	Building Portable Options: Skill Transfer in Reinforcement Learning	claim
194	158	A Conceptual Graph Approach for the Generation of Referring Expressions	claim
195	158	Efficient Bayesian Task-Level Transfer Learning	claim
196	157	Automatic Decision of Piano Fingering Based on a Hidden Markov Models	claim
197	157	Symmetric Component Caching	claim
198	157	A Lattice-Based Approach to Computing Warranted Beliefs in Skeptical Argumentation Frameworks	claim
199	157	Towards Runtime Behavior Adaptation for Embodied Characters	claim
200	156	Online Learning and Exploiting Relational Models in Reinforcement Learning	claim
201	155	Learning User Clicks in Web Search	claim
202	155	EQL-Lite: Effective First-Order Query Processing in Description Logics	claim
203	154	r-grams: Relational Grams	claim
204	154	A Hybridized Planner for Stochastic Domains	claim
205	153	Dances with Words	claim
206	153	Supervised Latent Semantic Indexing Using Adaptive Sprinkling	claim
207	153	New Constraint Programming Approaches for the Computation of Leximin-Optimal Solutions in Constraint Networks	claim
208	153	From Sampling to Model Counting	claim
209	153	Model-Based Optimization of Testing through Reduction of Stimuli	claim
210	153	Learning Restart Strategies	claim
211	153	A Flexible Unsupervised PP-Attachment Method Using Semantic Information	claim
212	152	The Ins and Outs of Critiquing	claim
213	152	Using the Probabilistic Logic Programming Language P-log for Causal and Counterfactual Reasoning and Non-Naive Conditioning	claim
214	152	Exploiting Inference Rules to Compute Lower Bounds for MAX-SAT Solving	claim
215	151	Symmetry Breaking in Quantified Boolean Formulae	claim
216	151	Team Programming in Golog under Partial Observability	claim
217	151	Locating Complex Named Entities in Web Text	claim
218	151	Inside-Outside Probability Computation for Belief Propagation	claim
219	150	Real Boosting a la Carte with an Application to Boosting Oblique Decision Tree	claim
220	150	Dynamic Weighting A* Search-Based MAP Algorithm for Bayesian Networks	claim
221	149	Embedding Non-Ground Logic Programs into Autoepistemic Logic for Knowledge-Base Combination	claim
222	149	Planning under Risk and Knightian Uncertainty	claim
223	149	Machine Learning for On-Line Hardware Reconfiguration	claim
224	149	Adaptation of Organizational Models for Multi-Agent Systems Based on Max Flow Networks	claim
225	149	Semi-Supervised Learning of Attribute-Value Pairs from Product Descriptions	claim
226	149	Determining Expert Profiles (With an Application to Expert Finding)	claim
227	148	Automatic Verification of Knowledge and Time with NuSMV	claim
228	148	Handling Alternative Activities in Resource-Constrained Project Scheduling Problems	claim
229	148	Recursive Random Fields	claim
230	147	The Value of Observation for Monitoring Dynamic Systems	claim
231	147	Searching for Interacting Features	claim
232	147	On Modeling Multiagent Task Scheduling as a Distributed Constraint Optimization Problem	claim
233	147	A Cortex-Inspired Neural-Symbolic Network for Knowledge Representation	claim
234	146	Planning for Temporally Extended Goals as Propositional Satisfiability	claim
235	146	Learning by Analogy: A Classification Rule for Binary and Nominal Data	claim
236	146	Observation Reduction for Strong Plans	claim
237	145	Combining Topological and Directional Information for Spatial Reasoning	claim
238	145	Kernel Conjugate Gradient for Fast Kernel Machines	claim
239	145	Dynamic Verification of Trust in Distributed Open Systems	claim
240	144	Dealing with Perception Errors in Multi-Robot System Coordination	claim
241	143	Direct Code Access in Self-Organizing Neural Networks for Reinforcement Learning	claim
242	143	Improving Author Coreference by Resource-Bounded Information Gathering from the Web	claim
243	142	Hierarchical Heuristic Forward Search in Stochastic Domains	claim
244	142	Relevance Estimation and Value Calibration of Evolutionary Algorithm Parameters	claim
245	142	Scalable Diagnosability Checking of Event-Driven Systems	claim
246	142	Techniques for Efficient Interactive Configuration of Distribution Networks	claim
247	142	Multi-Document Summarization by Maximizing Informative Content-Words	claim
248	142	A General Framework for Scheduling in a Stochastic Environment	claim
249	142	Encoding Closure Operators into Neural Networks	claim
250	141	Incompleteness and Incomparability in Preference Aggregation	claim
251	141	A Multiobjective Frontier Search Algorithm	claim
252	141	Complexity of Pure Equilibria in Bayesian Games	claim
253	141	Efficient Planning of Informative Paths for Multiple Robots	claim
254	141	Learning Implied Global Constraints	claim
255	140	Permanents, Transport Polytopes and Positive Definite Kernels on Histograms	claim
256	140	Non-monotonic Temporal Logics for Goal Specification	claim
257	140	IJCAI-07 Reviewers	claim
258	140	Utile Distinctions for Relational Reinforcement Learning	claim
259	139	Qualitative Temporal Reasoning about Vague Events	claim
260	139	Pseudo-Aligned Multilingual Corpora	claim
261	139	Exploiting Independence in a Decentralised and Incremental Approach of Diagnosis	claim
262	138	Representing Kriegspiel States with Metapositions	claim
263	138	Extracting and Visualizing Trust Relationships from Online Auction Feedback Comments	claim
264	138	Word Sense Disambiguation with Spreading Activation Networks Generated from Thesauri	claim
265	137	Learning and Multiagent Reasoning for Autonomous Agents	claim
266	136	Backtracking Procedures for Hypertree, HyperSpread and Connected Hypertree Decomposition of CSPs	claim
267	136	An Experience on Reputation Models Interoperability Based on a Functional Ontology	claim
268	135	Sellers Competing for Buyers in Online Markets: Reserve Prices, Shill Bids, and Auction Fees	claim
269	135	The Logic Behind Weighted CSP	claim
270	135	Using Neural Network Models to Model Cerebral Hemispheric Differences in Processing Ambiguous Words	claim
271	135	Using Learned Policies in Heuristic-Search Planning	claim
272	132	Waiting and Relocation Strategies in Online Stochastic Vehicle Routing	claim
273	131	Kernel Carpentry for Online Regression Using Randomly Varying Coefficient Model	claim
274	131	Some Effects of a Reduced Relational Vocabulary on the Whodunit Problem	claim
275	129	A Ranking Approach to Pronoun Resolution	claim
276	129	Holonic Multiagent Multilevel Simulation: Application to Real-Time Pedestrian Simulation in Urban Environment	claim
277	128	Multi-issue Negotiation Protocol for Agents: Exploring Nonlinear Utility Spaces	claim
278	127	Interactive Clustering of Text Collections According to a User-Specified Criterion	claim
279	121	Subtree Mining for Question Classification Problem	claim
280	121	Efficient Calculation of Personalized Document Rankings	claim
281	120	Modeling When Connections Are the Problem	claim
282	119	A Study of Residual Supports in Arc Consistency	claim
283	113	A Primitive Based Generative Model to Infer Timing Information in Unpartitioned Handwriting Data	claim
284	112	Optimizing Classifier Performance in Word Sense Disambiguation by Redefining Sense Classes	claim
285	109	Topological Value Iteration Algorithm for Markov Decision Processes	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers