Sciweavers

1263 search results - page 132 / 253
» A* with Bounded Costs
Sort
View
GFKL
2007
Springer
152views Data Mining» more  GFKL 2007»
14 years 3 months ago
Supporting Web-based Address Extraction with Unsupervised Tagging
Abstract. The manual acquisition and modeling of tourist information as e.g. addresses of points of interest is time and, therefore, cost intensive. Furthermore, the encoded inform...
Berenike Loos, Chris Biemann
ISI
2005
Springer
14 years 3 months ago
Information Supply Chain: A Unified Framework for Information-Sharing
To balance demand and supply of information, we propose a framework called “information supply chain” (ISC). This framework is based on supply chain management (SCM), which has...
Shuang Sun, John Yen
DOLAP
2003
ACM
14 years 2 months ago
Hierarchical dwarfs for the rollup cube
The data cube operator exemplifies two of the most important aspects of OLAP queries: aggregation and dimension hierarchies. In earlier work we presented Dwarf, a highly compress...
Yannis Sismanis, Antonios Deligiannakis, Yannis Ko...
HPDC
1997
IEEE
14 years 1 months ago
Supporting Parallel Applications on Clusters of Workstations: The Intelligent Network Interface Approach
This paper presents a novel networking architecture designed for communication intensive parallel applications running on clusters of workstations (COWs) connected by highspeed ne...
Marcel-Catalin Rosu, Karsten Schwan, Richard Fujim...
AIPS
2009
13 years 10 months ago
Inference and Decomposition in Planning Using Causal Consistent Chains
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
Nir Lipovetzky, Hector Geffner