3008 search results - page 462 / 602 » Independence in connected graphs |
248
click to vote
COMGEO
2006
ACM
15 years 7 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
186
click to vote
BMCBI
2005
15 years 7 months ago
2005
Background: This paper describes an automated method for finding clusters of interconnected proteins in protein interaction networks and retrieving protein annotations associated ...
242
click to vote
PVLDB
2010
15 years 1 months ago
2010
We present Schism, a novel workload-aware approach for database partitioning and replication designed to improve scalability of sharednothing distributed databases. Because distri...
220
click to vote
CIKM
2011
Springer
14 years 7 months ago
2011
Springer
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
218
click to vote
MOBIHOC
2004
ACM
16 years 6 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...