Sciweavers

4208 search results - page 589 / 842
» Challenges in Evaluating Distributed Algorithms
Sort
View
VLDB
2007
ACM
124views Database» more  VLDB 2007»
15 years 8 months ago
Ad-hoc Top-k Query Answering for Data Streams
A top-k query retrieves the k highest scoring tuples from a data set with respect to a scoring function defined on the attributes of a tuple. The efficient evaluation of top-k q...
Gautam Das, Dimitrios Gunopulos, Nick Koudas, Niko...
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
16 years 2 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
GIS
2007
ACM
15 years 5 months ago
Optimal traversal planning in road networks with navigational constraints
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...
SPLC
2008
15 years 3 months ago
Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
Jules White, B. Doughtery, Douglas C. Schmidt
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
15 years 3 months ago
Agent-based support for interactive search in conceptual software engineering design
While recent attempts to search a conceptual software engineering design search space with multi-objective evolutionary algorithms have yielded promising results, the practical ap...
Christopher L. Simons, Ian C. Parmee