2283 search results - page 114 / 457 » Bounds of Graph Characteristics |
174
Voted
WG
2010
Springer
15 years 3 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
169
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
163
Voted
SIGCSE
2000
ACM
15 years 10 months ago
2000
ACM
Undergraduates are usually introduced to synchronization in operating systems through a discussion of classical problems such as reader-writer or producers-consumers. The traditio...
201
click to vote
COCO
1997
Springer
15 years 9 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
167
click to vote
FUN
2007
Springer
15 years 9 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...