Sciweavers

10608 search results - page 614 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
PODS
2006
ACM
107views Database» more  PODS 2006»
16 years 7 months ago
Programmable clustering
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar
RECSYS
2009
ACM
16 years 1 months ago
Recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
Aditya G. Parameswaran, Hector Garcia-Molina
ICC
2007
IEEE
121views Communications» more  ICC 2007»
16 years 1 months ago
Cooperative Vehicle Position Estimation
Abstract— We present a novel cooperative vehicle position estimation algorithm, which can achieve higher levels of accuracy and reliability than existing GPS based positioning so...
Ryan Parker, Shahrokh Valaee
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
16 years 1 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul
STACS
2007
Springer
16 years 1 months ago
Enumerating All Solutions for Constraint Satisfaction Problems
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
Henning Schnoor, Ilka Schnoor