Sciweavers

176 search results - page 22 / 36
» Scaling Database Languages to Higher-Order Distributed Progr...
Sort
View
SIGSOFT
2007
ACM
14 years 8 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
IPPS
2002
IEEE
14 years 13 days ago
Improving Performance of Multiple Sequence Alignment Analysis in Multi-Client Environments
This paper is concerned with the efficient execution of multiplesequence alignmentmethodsin a multipleclientenvironment. Multiple sequence alignment (MSA) is a computationally ex...
Ümit V. Çatalyürek, Eric Stahlber...
JAIR
2008
118views more  JAIR 2008»
13 years 7 months ago
On the Use of Automatically Acquired Examples for All-Nouns Word Sense Disambiguation
This article focuses on Word Sense Disambiguation (WSD), which is a Natural Language Processing task that is thought to be important for many Language Technology applications, suc...
David Martínez, Oier Lopez de Lacalle, Enek...
ICALP
2009
Springer
14 years 7 months ago
Towards a Study of Low-Complexity Graphs
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
Sanjeev Arora, David Steurer, Avi Wigderson
BMCBI
2006
139views more  BMCBI 2006»
13 years 7 months ago
Integrated functional visualization of eukaryotic genomes
Background: Increasing amounts of data from large scale whole genome analysis efforts demands convenient tools for manipulation, visualization and investigation. Whole genome plot...
Rohit Ghai, Hannes Lindemann, Trinad Chakraborty