Sciweavers

8413 search results - page 1205 / 1683
» Ordering Problem Subgoals
Sort
View
LATIN
2010
Springer
16 years 1 months ago
Compact Rich-Functional Binary Relation Representations
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...
Jérémy Barbay, Francisco Claude, Gon...
AINA
2009
IEEE
16 years 1 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
CVPR
2009
IEEE
16 years 1 months ago
Contextualizing histogram
In this paper, we investigate how to incorporate spatial and/or temporal contextual information into classical histogram features with the aim of boosting visual classification p...
Bingbing Ni, Shuicheng Yan, Ashraf A. Kassim
HICSS
2009
IEEE
130views Biometrics» more  HICSS 2009»
16 years 1 months ago
A Systematic Approach to Improve Communication for Emergency Response
The importance of communication, information sharing and interoperability in an emergency response scenario have risen recently based on the frequency of disasters throughout the ...
Raheleh B. Dilmaghani, Ramesh R. Rao
ICDE
2009
IEEE
145views Database» more  ICDE 2009»
16 years 1 months ago
Context-Aware Object Connection Discovery in Large Graphs
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
James Cheng, Yiping Ke, Wilfred Ng, Jeffrey Xu Yu
« Prev « First page 1205 / 1683 Last » Next »