1458 search results - page 90 / 292 » Monads for incremental computing |
109
click to vote
TAMC
2010
Springer
15 years 5 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
105
click to vote
SMA
1995
ACM
15 years 3 months ago
1995
ACM
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
128
click to vote
DOLAP
2005
ACM
15 years 1 months ago
2005
ACM
Materialized views are nowadays commonly used in the data warehouse environment. Materialized views need to be updated when data sources change. Since the update of the views may ...
IJCAI
2007
15 years 1 months ago
2007
Most existing sketch understanding systems require a closed domain to achieve recognition. This paper describes an incremental learning technique for opendomain recognition. Our s...
BDA
2006
15 years 1 months ago
2006
Many data on the Web are XML documents. An XML document is an unranked labelled tree. A schema for XML documents (for instance a DTD) is the specification of their internal structu...