Sciweavers

3055 search results - page 220 / 611
» Randomized Search Trees
Sort
View
100
Voted
ALGORITHMS
2010
114views more  ALGORITHMS 2010»
14 years 10 months ago
Graph Extremities Defined by Search Algorithms
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Ge...
138
Voted
PVLDB
2010
128views more  PVLDB 2010»
14 years 7 months ago
Searching Workflows with Hierarchical Views
Workflows are prevalent in diverse applications, which can be scientific experiments, business processes, web services, or recipes. With the dramatically growing number of workflo...
Ziyang Liu, Qihong Shao, Yi Chen
120
Voted
CVPR
2009
IEEE
16 years 8 months ago
StaRSaC: Stable Random Sample Consensus for Parameter Estimation
We address the problem of parameter estimation in presence of both uncertainty and outlier noise. This is a common occurrence in computer vision: feature localization is perform...
Jongmoo Choi, Gérard G. Medioni
ASIACRYPT
2009
Springer
15 years 7 months ago
Simple Adaptive Oblivious Transfer without Random Oracle
Adaptive oblivious transfer (adaptive OT) schemes have wide applications such as oblivious database searches, secure multiparty computation and etc. It is a two-party protocol whic...
Kaoru Kurosawa, Ryo Nojima
CSR
2007
Springer
15 years 7 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka