Sciweavers

1201 search results - page 81 / 241
» Linear Probing and Graphs
Sort
View
PVLDB
2010
151views more  PVLDB 2010»
15 years 2 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ļ...
Kathy Macropol, Ambuj K. Singh
NETWORKS
2006
15 years 4 months ago
A simple algorithm that proves half-integrality of bidirected network programming
In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any colum...
Ethan D. Bolker, Thomas Zaslavsky
TCS
2012
13 years 11 months ago
Improved simulation of nondeterministic Turing machines
Abstract. The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in th...
Subrahmanyam Kalyanasundaram, Richard J. Lipton, K...
CLEAR
2007
Springer
271views Biometrics» more  CLEAR 2007»
15 years 10 months ago
The AIT Multimodal Person Identification System for CLEAR 2007
This paper presents the person identification system developed at Athens Information Technology and its performance in the CLEAR 2007 evaluations. The system operates on the audiov...
Andreas Stergiou, Aristodemos Pnevmatikakis, Lazar...
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
15 years 10 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh