Sciweavers

1053 search results - page 134 / 211
» On k-Path Covers and their applications
Sort
View
AIPS
2011
14 years 10 months ago
Directed Search for Generalized Plans Using Classical Planners
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
GIS
2011
ACM
14 years 9 months ago
Embedding rivers in triangulated irregular networks with linear programming
Data conflation is a major issue in GIS: different geospatial data sets covering overlapping regions, possibly obtained from different sources and using different acquisition ...
Marc J. van Kreveld, Rodrigo I. Silveira
NIXDORF
1992
116views Hardware» more  NIXDORF 1992»
15 years 10 months ago
Programmable Active Memories: A Performance Assessment
We present some quantitative performance measurements for the computing power of Programmable Active Memories (PAM), as introduced by [2]. Based on Field Programmable Gate Array (...
Patrice Bertin, Didier Roncin, Jean Vuillemin
WWW
2001
ACM
16 years 7 months ago
Efficient Acquisition of Web Data through Restricted Query Interfaces
A wealth of information is available on the Web. But often, such data are hidden behind form interfaces which allow only a restrictive set of queries over the underlying databases...
Cláudio T. Silva, Juliana Freire, Simon Bye...
CHI
2010
ACM
16 years 1 months ago
Individual models of color differentiation to improve interpretability of information visualization
Color is commonly used to represent categories and values in many computer applications, but differentiating these colors can be difficult in many situations (e.g., for users with...
David R. Flatla, Carl Gutwin