Sciweavers

350 search results - page 55 / 70
» What's in a Name
Sort
View
ACL
2008
14 years 9 days ago
The Tradeoffs Between Open and Traditional Relation Extraction
Traditional Information Extraction (IE) takes a relation name and hand-tagged examples of that relation as input. Open IE is a relationindependent extraction paradigm that is tail...
Michele Banko, Oren Etzioni
DAM
2008
114views more  DAM 2008»
13 years 11 months ago
Efficient solutions to the braid isotopy problem
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
Patrick Dehornoy
ECOI
2007
101views more  ECOI 2007»
13 years 10 months ago
Reasoning about taxonomies in first-order logic
Experts often disagree about the organization of biological taxa. The shifting definitions of taxonomic names complicate otherwise simple queries concerning these taxa. For examp...
David Thau, Bertram Ludäscher
PVLDB
2008
163views more  PVLDB 2008»
13 years 10 months ago
C-DEM: a multi-modal query system for Drosophila Embryo databases
The amount of biological data publicly available has experienced an exponential growth as the technology advances. Online databases are now playing an important role as informatio...
Fan Guo, Lei Li, Christos Faloutsos, Eric P. Xing
CRYPTO
2006
Springer
119views Cryptology» more  CRYPTO 2006»
14 years 2 months ago
Rankin's Constant and Blockwise Lattice Reduction
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Ph...