Sciweavers

4066 search results - page 53 / 814
» Almost Complete Sets
Sort
View
ICDM
2007
IEEE
109views Data Mining» more  ICDM 2007»
14 years 4 months ago
Language-Independent Set Expansion of Named Entities Using the Web
Set expansion refers to expanding a given partial set of objects into a more complete set. A well-known example system that does set expansion using the web is Google Sets. In thi...
Richard C. Wang, William W. Cohen
ECAL
2007
Springer
14 years 4 months ago
Turing Complete Catalytic Particle Computers
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to c...
Anthony M. L. Liekens, Chrisantha Thomas Fernando
AIIA
2003
Springer
14 years 3 months ago
A Complete Subsumption Algorithm
Abstract. Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of ...
Stefano Ferilli, Nicola Di Mauro, Teresa Maria Alt...
CHI
1994
ACM
14 years 2 months ago
A groupware environment for complete meetings
1 A virtual meeting room is the electronic place where meetings actually occur, and collects people, tools, and computer agents into a desktop conference. Meetings have different ...
Ted O'Grady, Saul Greenberg
CAV
2010
Springer
214views Hardware» more  CAV 2010»
14 years 1 months ago
Comfusy: A Tool for Complete Functional Synthesis
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. We present Comfusy, a tool that extends the compiler for the gener...
Viktor Kuncak, Mikaël Mayer, Ruzica Piskac, P...