Sciweavers

444 search results - page 44 / 89
» Selectional Restrictions in HPS
Sort
View
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
14 years 7 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
MOBIHOC
2008
ACM
14 years 7 months ago
Localized distance-sensitive service discovery in wireless sensor networks
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...
Xu Li, Nicola Santoro, Ivan Stojmenovic
ELPUB
2000
ACM
13 years 12 months ago
Multimedia Cd-Rom as a Medium for Manuscript Preservation and Dissemination: The Design and Development of "Treasures of Islam"
The paper discusses the use of electronic publishing for the preservation and dissemination of rare manuscript material. It is based both upon the authors’ earlier work on multi...
Andrew Large, Jamshid Beheshti, Haidar Moukdad
EOR
2008
123views more  EOR 2008»
13 years 7 months ago
A combined approach for segment-specific market basket analysis
Market baskets arise from consumers' shopping trips and include items from multiple categories that are frequently chosen interdependently from each other. Explanatory models...
Yasemin Boztug, Thomas Reutterer
MP
2002
143views more  MP 2002»
13 years 7 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck