Sciweavers

8647 search results - page 1607 / 1730
» The Container Selection Problem
Sort
View
AI
2000
Springer
15 years 2 months ago
Learning to construct knowledge bases from the World Wide Web
The World Wide Web is a vast source of information accessible to computers, but understandable only to humans. The goal of the research described here is to automatically create a...
Mark Craven, Dan DiPasquo, Dayne Freitag, Andrew M...
CC
2002
Springer
145views System Software» more  CC 2002»
15 years 2 months ago
Forwarding in Attribute Grammars for Modular Language Design
Abstract. Forwarding is a technique for providing default attribute definitions in attribute grammars that is helpful in the modular implementation of programming languages. It com...
Eric Van Wyk, Oege de Moor, Kevin Backhouse, Paul ...
DT
2000
88views more  DT 2000»
15 years 2 months ago
Postsilicon Validation Methodology for Microprocessors
f abstraction as applicable to break the problem's complexity, and innovating better techniques to address complexity of new microarchitectural features. Validation techniques...
Hemant G. Rotithor
CACM
1998
110views more  CACM 1998»
15 years 2 months ago
Viewing WISs as Database Applications
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
Gustavo O. Arocena, Alberto O. Mendelzon
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
15 years 2 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
« Prev « First page 1607 / 1730 Last » Next »