Sciweavers

138 search results - page 28 / 28
» The Complexity of Quickly ORM-Decidable Sets
Sort
View
TOG
2010
117views more  TOG 2010»
12 years 11 months ago
Multi-feature matching of fresco fragments
We present a multiple-feature approach for determining matches between small fragments of archaeological artifacts such as Bronze-Age and Roman frescoes. In contrast with traditio...
Corey Toler-Franklin, Benedict J. Brown, Tim Weyri...
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 7 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
13 years 10 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler