Sciweavers

3875 search results - page 304 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
HIPC
2007
Springer
15 years 10 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
ICML
2010
IEEE
15 years 7 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
ICRA
2010
IEEE
99views Robotics» more  ICRA 2010»
15 years 5 months ago
Retraction-based RRT planner for articulated models
— We present a new retraction algorithm for high DOF articulated models and use our algorithm to improve the performance of RRT planners in narrow passages. The retraction step i...
Jia Pan, Liangjun Zhang, Dinesh Manocha
PROCEDIA
2010
113views more  PROCEDIA 2010»
15 years 5 months ago
Exploring utilisation of GPU for database applications
This study is devoted to exploring possible applications of GPU technology for acceleration of the database access. We use the n-gram based approximate text search engine as a tes...
Slawomir Walkowiak, Konrad Wawruch, Marita Nowotka...
COMPGEOM
2011
ACM
14 years 10 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...