Sciweavers

2969 search results - page 460 / 594
» A space efficient algorithm for group structure computation
Sort
View
MICRO
1997
IEEE
141views Hardware» more  MICRO 1997»
15 years 10 months ago
Unroll-and-Jam Using Uniformly Generated Sets
Modern architectural trends in instruction-level parallelism (ILP) are to increase the computational power of microprocessors significantly. As a result, the demands on memory ha...
Steve Carr, Yiping Guan
PR
2006
78views more  PR 2006»
15 years 6 months ago
Similarity-based analysis for large networks of ultra-low resolution sensors
By analyzing the similarities between bit streams coming from a network of motion detectors, we can recover the network geometry and discover structure in the human behavior being...
Christopher Richard Wren, David C. Minnen, Sriniva...
WG
1993
Springer
15 years 10 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
171
Voted
WWW
2008
ACM
16 years 7 months ago
On incremental maintenance of 2-hop labeling of graphs
Recent interests on XML, Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the re...
Ramadhana Bramandia, Byron Choi, Wee Keong Ng
CIKM
2008
Springer
15 years 8 months ago
Learning latent semantic relations from clickthrough data for query suggestion
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu