Sciweavers

403 search results - page 29 / 81
» Plenoptic path and its applications
Sort
View
CONSTRAINTS
2008
90views more  CONSTRAINTS 2008»
13 years 8 months ago
Combining Tree Partitioning, Precedence, and Incomparability Constraints
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
Nicolas Beldiceanu, Pierre Flener, Xavier Lorca
SIGMOD
2010
ACM
215views Database» more  SIGMOD 2010»
13 years 11 months ago
Dynamic symbolic database application testing
A database application differs form regular applications in that some of its inputs may be database queries. The program will execute the queries on a database and may use any re...
Chengkai Li, Christoph Csallner
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
14 years 9 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
ICNC
2005
Springer
14 years 1 months ago
DNA Computing for Complex Scheduling Problem
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
Mohd Saufee Muhammad, Zuwairie Ibrahim, Satomi Ued...
CINQ
2004
Springer
189views Database» more  CINQ 2004»
14 years 1 months ago
Employing Inductive Databases in Concrete Applications
In this paper we present the application of the inductive database approach to two practical analytical case studies: Web usage mining in Web logs and financial data. As far as co...
Rosa Meo, Pier Luca Lanzi, Maristella Matera, Dani...