Sciweavers

3368 search results - page 95 / 674
» The Complexity of Query Reliability
Sort
View
VLDB
1997
ACM
140views Database» more  VLDB 1997»
14 years 1 months ago
Parallel Query Scheduling and Optimization with Time- and Space-Shared Resources
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
Minos N. Garofalakis, Yannis E. Ioannidis
ITNG
2006
IEEE
14 years 2 months ago
Utilizing XML Schema for Describing and Querying Still Image Databases
In this paper, still images are modeled by hierarchical tree structures and object relational graphs. These modeling concepts can be described naturally using XML schema. We intro...
Kazem Taghva, Min Xu, Emma Regentova, Tom Nartker
ICDE
2011
IEEE
220views Database» more  ICDE 2011»
13 years 19 days ago
Generating test data for killing SQL mutants: A constraint-based approach
—Complex SQL queries are widely used today, but it is rather difficult to check if a complex query has been written correctly. Formal verification based on comparing a specifi...
Shetal Shah, S. Sudarshan, Suhas Kajbaje, Sandeep ...
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 11 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
LREC
2010
144views Education» more  LREC 2010»
13 years 10 months ago
Evaluating Complex Semantic Artifacts
Evaluating complex Natural Language Processing (NLP) systems can prove extremely difficult. In many cases, the best one can do is to evaluate these systems indirectly, by looking ...
Christopher R. Walker, Hannah Copperman