1469 search results - page 177 / 294 » Approximate polynomial decomposition |
177
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
186
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
166
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
163
click to vote
ICWS
2009
IEEE
16 years 3 months ago
2009
IEEE
Recently, a new generation of adaptive process management technology has emerged, which enables dynamic changes of composite services and process models respectively. This, in tur...
169
click to vote
WAOA
2005
Springer
15 years 12 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...