Sciweavers

6575 search results - page 764 / 1315
» Specializing visualization algorithms
Sort
View
TOPLAS
2008
81views more  TOPLAS 2008»
15 years 6 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
CVIU
2004
134views more  CVIU 2004»
15 years 6 months ago
The "dead reckoning" signed distance transform
Consider a binary image containing one or more objects. A signed distance transform assigns to each pixel (voxel, etc.), both inside and outside of any objects, the minimum distan...
George J. Grevera
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
15 years 6 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
MOBISYS
2009
ACM
16 years 7 months ago
SoundSense: scalable sound sensing for people-centric applications on mobile phones
Top end mobile phones include a number of specialized (e.g., accelerometer, compass, GPS) and general purpose sensors (e.g., microphone, camera) that enable new people-centric sen...
Hong Lu, Wei Pan, Nicholas D. Lane, Tanzeem Choudh...
MICRO
2006
IEEE
145views Hardware» more  MICRO 2006»
16 years 15 days ago
Virtually Pipelined Network Memory
We introduce virtually-pipelined memory, an architectural technique that efficiently supports high-bandwidth, uniform latency memory accesses, and high-confidence throughput eve...
Banit Agrawal, Timothy Sherwood