5169 search results - page 618 / 1034 » Locality approximation using time |
197
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract. Knowledge discovery is a time-consuming and space intensive endeavor. By distributing such an endeavor, we can diminish both time and space. System INDED pronounced indee...
197
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
It is shown that the queuing delay involved in the congestion control algorithm is state-dependent and does not depend on the current time. Then, using an accurate formulation for ...
161
Voted
WDAG
2007
Springer
16 years 1 months ago
2007
Springer
We introduce the problem of load-distance balancing in assigning users of a delay-sensitive networked application to servers. We model the service delay experienced by a user as a ...
234
click to vote
FGR
2011
IEEE
14 years 10 months ago
2011
IEEE
— In this work, we present novel warping algorithms for full 2D pixel-grid deformations for face recognition. Due to high variation in face appearance, face recognition is consid...
245
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...