Sciweavers

1578 search results - page 285 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
MM
2004
ACM
99views Multimedia» more  MM 2004»
14 years 3 months ago
Locality preserving clustering for image database
It is important and challenging to make the growing image repositories easy to search and browse. Image clustering is a technique that helps in several ways, including image data ...
Xin Zheng, Deng Cai, Xiaofei He, Wei-Ying Ma, Xuey...
PLDI
2004
ACM
14 years 3 months ago
Parametric regular path queries
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....
FSTTCS
2006
Springer
14 years 1 months ago
Computing a Center-Transversal Line
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sel...
ATMOS
2007
13 years 11 months ago
Maintenance of Multi-level Overlay Graphs for Timetable Queries
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
Francesco Bruera, Serafino Cicerone, Gianlorenzo D...
AAAI
2006
13 years 11 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer