Sciweavers

1128 search results - page 190 / 226
» A Case for Buffer Servers
Sort
View
IANDC
2008
141views more  IANDC 2008»
14 years 11 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
CVPR
1999
IEEE
16 years 1 months ago
Background Estimation and Removal Based on Range and Color
Background estimation and removal based on the joint use of range and color data produces superior results than can be achieved with either data source alone. This is increasingly...
Gaile G. Gordon, Trevor Darrell, Michael Harville,...
GIS
2007
ACM
16 years 25 days ago
Partition-based lazy updates for continuous queries over moving objects
Continuous spatial queries posted within an environment of moving objects produce as their results a time-varying set of objects. In the most ambitious case both queries and data ...
Yu-Ling Hsueh, Roger Zimmermann, Haojun Wang, Wei-...
GIS
2005
ACM
16 years 24 days ago
Supporting uncertainty in moving objects in network databases
The management of moving objects has been intensively studied in the recent years. A wide and increasing range of database applications has to deal with spatial objects whose posi...
Ralf Hartmut Güting, Victor Teixeira de Almei...
DAC
2003
ACM
16 years 22 days ago
Automated synthesis of efficient binary decoders for retargetable software toolkits
A binary decoder is a common component of software development tools such as instruction set simulators, disassemblers and debuggers. The efficiency of the decoder can have a sign...
Wei Qin, Sharad Malik