Sciweavers

4791 search results - page 380 / 959
» Clustering with partial information
Sort
View
INFORMS
2006
87views more  INFORMS 2006»
15 years 7 months ago
Early Estimates of the Size of Branch-and-Bound Trees
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
Gérard Cornuéjols, Miroslav Karamano...
CIKM
2008
Springer
15 years 9 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...
BMCBI
2010
147views more  BMCBI 2010»
15 years 7 months ago
Automatic detection of anchor points for multiple sequence alignment
Background: Determining beforehand specific positions to align (anchor points) has proved valuable for the accuracy of automated multiple sequence alignment (MSA) software. This f...
Florian Pitschi, Claudine Devauchelle, Eduardo Cor...
SIGIR
2009
ACM
16 years 2 months ago
A latent topic model for linked documents
Documents in many corpora, such as digital libraries and webpages, contain both content and link information. To explicitly consider the document relations represented by links, i...
Zhen Guo, Shenghuo Zhu, Yun Chi, Zhongfei Zhang, Y...
SAC
2006
ACM
16 years 1 months ago
Personalization and visualization on handheld devices
The small screen size of handheld mobile devices poses an inherent problem in visualizing data: very often it is too difficult and unpleasant to navigate through the plethora of p...
Dongsong Zhang, George Karabatis, Zhiyuan Chen, Bo...