Sciweavers

1969 search results - page 134 / 394
» Challenges in Enterprise Search
Sort
View
BMCBI
2010
116views more  BMCBI 2010»
13 years 9 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel
CIKM
2011
Springer
12 years 9 months ago
Personalizing web search results by reading level
Traditionally, search engines have ignored the reading difficulty of documents and the reading proficiency of users in computing a document ranking. This is one reason why Web se...
Kevyn Collins-Thompson, Paul N. Bennett, Ryen W. W...
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
14 years 10 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
CHI
2009
ACM
14 years 10 months ago
Web search and browsing behavior under poor connectivity
Web search and browsing have been streamlined for a comfortable experience when the network connection is fast. Existing tools, however, are not optimized for scenarios where conn...
Jay Chen, Lakshminarayanan Subramanian, Kentaro To...
GECCO
2007
Springer
211views Optimization» more  GECCO 2007»
14 years 3 months ago
An extremal optimization search method for the protein folding problem: the go-model example
The protein folding problem consists of predicting the functional (native) structure of the protein given its linear sequence of amino acids. Despite extensive progress made in un...
Alena Shmygelska