Sciweavers

365 search results - page 69 / 73
» Solving the Multiplication Constraint in Several Approximati...
Sort
View
ALGORITHMICA
2011
13 years 2 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
AAAI
2010
13 years 9 months ago
Multi-Agent Plan Recognition: Formalization and Algorithms
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
Bikramjit Banerjee, Landon Kraemer, Jeremy Lyle
PAMI
2010
168views more  PAMI 2010»
13 years 6 months ago
Surface-from-Gradients without Discrete Integrability Enforcement: A Gaussian Kernel Approach
—Representative surface reconstruction algorithms taking a gradient field as input enforces the integrability constraint in a discrete manner. While enforcing integrability allo...
Heung-Sun Ng, Tai-Pang Wu, Chi-Keung Tang
EUROSYS
2006
ACM
14 years 4 months ago
Ferret: a toolkit for content-based similarity search of feature-rich data
Building content-based search tools for feature-rich data has been a challenging problem because feature-rich data such as audio recordings, digital images, and sensor data are in...
Qin Lv, William Josephson, Zhe Wang, Moses Charika...
PLDI
2003
ACM
14 years 23 days ago
Meta optimization: improving compiler heuristics with machine learning
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
Mark Stephenson, Saman P. Amarasinghe, Martin C. M...