Sciweavers

11231 search results - page 2074 / 2247
» Digging for Data Structures
Sort
View
CODES
2011
IEEE
14 years 2 months ago
Dynamic, multi-core cache coherence architecture for power-sensitive mobile processors
Today, mobile smartphones are expected to be able to run the same complex, memory-intensive applications that were originally designed and coded for general-purpose processors. Ho...
Garo Bournoutian, Alex Orailoglu
HUC
2011
Springer
14 years 2 months ago
The social fMRI: measuring, understanding, and designing social mechanisms in the real world
A key challenge of data-driven social science is the gathering of high quality multi-dimensional datasets. A second challenge relates to design and execution of structured experim...
Nadav Aharony, Wei Pan, Cory Ip, Inas Khayal, Alex...
ICDAR
2011
IEEE
14 years 2 months ago
Chinese Keyword Spotting Using Knowledge-Based Clustering
—Content-based document image retrieval is a new and promising research area. Without OCR, document indexing directly based on image content is more general and convenient. Howev...
Yong Xia, Kuanquan Wang, Mingwei Li
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 8 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
CN
2004
148views more  CN 2004»
15 years 2 months ago
Multiway range trees: scalable IP lookup with fast updates
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
Priyank Ramesh Warkhede, Subhash Suri, George Varg...
« Prev « First page 2074 / 2247 Last » Next »