Sciweavers

1982 search results - page 96 / 397
» Designing Efficient Distributed Algorithms Using Sampling Te...
Sort
View
138
Voted
TCAD
1998
114views more  TCAD 1998»
15 years 2 months ago
Behavioral optimization using the manipulation of timing constraints
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
Miodrag Potkonjak, Mani B. Srivastava
129
Voted
IJCV
2000
161views more  IJCV 2000»
15 years 2 months ago
Probabilistic Detection and Tracking of Motion Boundaries
We propose a Bayesian framework for representing and recognizing local image motion in terms of two basic models: translational motion and motion boundaries. Motion boundaries are ...
Michael J. Black, David J. Fleet
137
Voted
BMCBI
2008
122views more  BMCBI 2008»
15 years 2 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang
91
Voted
HOTOS
2009
IEEE
15 years 6 months ago
Peloton: Coordinated Resource Management for Sensor Networks
This paper makes the case that operating system designs for sensor networks should focus on the coordination of resource management decisions across the network, rather than merel...
Jason Waterman, Geoffrey Werner Challen, Matt Wels...
121
Voted
MOBIHOC
2003
ACM
16 years 2 months ago
Connected sensor cover: self-organization of sensor networks for efficient query execution
Spatial query execution is an essential functionality of a sensor network, where a query gathers sensor data within a specific geographic region. Redundancy within a sensor networ...
Himanshu Gupta, Samir R. Das, Quinyi Gu