Sciweavers

2412 search results - page 353 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
DOLAP
2006
ACM
15 years 6 months ago
Building a web warehouse for accessibility data
As more and more information is available on the web, it is a problem that many web resources are not accessible, i.e., are not usable for users with special needs. For example, f...
Christian Thomsen, Torben Bach Pedersen
IJIT
2004
15 years 4 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case
237
Voted
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
16 years 2 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
132
Voted
NIPS
2003
15 years 3 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
136
Voted
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 2 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...