724 search results - page 92 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
174
click to vote
FUN
2010
Springer
15 years 6 months ago
2010
Springer
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
146
click to vote
TVCG
2008
15 years 1 months ago
2008
Mesh parameterization is a fundamental technique in computer graphics. The major goals during mesh parameterization are to minimize both the angle distortion and the area distortio...
129
click to vote
IPSN
2003
Springer
15 years 8 months ago
2003
Springer
In this paper we present a distributed, application-morphable, algorithm for waking up appropriate sensor nodes in a heterogeneous sensor network. We assume a sensor field consisti...
115
click to vote
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with ...
238
click to vote
ICDE
2007
IEEE
16 years 4 months ago
2007
IEEE
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...