Sciweavers

1017 search results - page 75 / 204
» Some existence and construction results of polygonal designs
Sort
View
AAAI
2010
15 years 7 months ago
How Incomplete Is Your Semantic Web Reasoner?
Conjunctive query answering is a key reasoning service for many ontology-based applications. In order to improve scalability, many Semantic Web query answering systems give up com...
Giorgos Stoilos, Bernardo Cuenca Grau, Ian Horrock...
ICDE
2007
IEEE
193views Database» more  ICDE 2007»
16 years 7 months ago
Categorization and Optimization of Synchronization Dependencies in Business Processes
requirement. Furthermore, programming using sequence constructs normally produce nested structures and The current approachfor modeling synchronization in scattered code, especiall...
Qinyi Wu, Calton Pu, Akhil Sahai, Roger S. Barga
ICSE
1999
IEEE-ACM
15 years 10 months ago
Lightweight Extraction of Object Models from Bytecode
A program’s object model captures the essence of its design. For some programs, no object model was developed during design; for others, an object model exists but may be out-of...
Daniel Jackson, Allison Waingold
EJC
2007
15 years 6 months ago
Quickly deciding minor-closed parameters in general graphs
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
VLDB
2006
ACM
171views Database» more  VLDB 2006»
16 years 6 months ago
Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lu...