Sciweavers

8294 search results - page 1027 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
206
Voted
JUCS
2008
130views more  JUCS 2008»
15 years 7 months ago
Feature Selection for the Classification of Large Document Collections
: Feature selection methods are often applied in the context of document classification. They are particularly important for processing large data sets that may contain millions of...
Janez Brank, Dunja Mladenic, Marko Grobelnik, Nata...
ADC
2003
Springer
182views Database» more  ADC 2003»
16 years 16 days ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
216
Voted
IJCV
2006
161views more  IJCV 2006»
15 years 7 months ago
Discriminative Random Fields
In this research we address the problem of classification and labeling of regions given a single static natural image. Natural images exhibit strong spatial dependencies, and mode...
Sanjiv Kumar, Martial Hebert
183
Voted
BMCBI
2006
179views more  BMCBI 2006»
15 years 7 months ago
Accurate and unambiguous tag-to-gene mapping in serial analysis of gene expression
Background: In this study, we present a robust and reliable computational method for tag-togene assignment in serial analysis of gene expression (SAGE). The method relies on curre...
Rodrigo Malig, Cristian Varela, Eduardo Agosin, Fr...
180
Voted
DSN
2007
IEEE
16 years 1 months ago
What Supercomputers Say: A Study of Five System Logs
If we hope to automatically detect and diagnose failures in large-scale computer systems, we must study real deployed systems and the data they generate. Progress has been hampere...
Adam J. Oliner, Jon Stearley
« Prev « First page 1027 / 1659 Last » Next »