Sciweavers

2260 search results - page 247 / 452
» A new algorithm for clustering search results
Sort
View
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
14 years 9 months ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives
LION
2007
Springer
100views Optimization» more  LION 2007»
16 years 21 days ago
Nested Partitioning for the Minimum Energy Broadcast Problem
The problem of finding the broadcast scheme with minimum power consumption in a wireless ad-hoc network is NP-hard. This work presents a new hybrid algorithm to solve this problem...
Sameh Al-Shihabi, Peter Merz, Steffen Wolf
TAMC
2007
Springer
16 years 20 days ago
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
Michael Dom, Jiong Guo, Rolf Niedermeier
SIGMOD
2009
ACM
220views Database» more  SIGMOD 2009»
16 years 6 months ago
Keyword search in databases: the power of RDBMS
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
Lu Qin, Jeffrey Xu Yu, Lijun Chang
ECMDAFA
2010
Springer
228views Hardware» more  ECMDAFA 2010»
15 years 10 months ago
Example-Based Sequence Diagrams to Colored Petri Nets Transformation Using Heuristic Search
Dynamic UML models like sequence diagrams (SD) lack sufficient formal semantics, making it difficult to build automated tools for their analysis, simulation and validation. A commo...
Marouane Kessentini, Arbi Bouchoucha, Houari A. Sa...