Sciweavers

102 search results - page 19 / 21
» Prioritizing User-Session-Based Test Cases for Web Applicati...
Sort
View
WWW
2005
ACM
14 years 8 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
WEBI
2004
Springer
14 years 23 days ago
Mining Local Data Sources For Learning Global Cluster Models
— Distributed data mining has recently caught a lot of attention as there are many cases where pooling distributed data for mining is probibited, due to either huge data volume o...
Chak-Man Lam, Xiaofeng Zhang, William Kwok-Wai Che...
CIKM
2005
Springer
14 years 29 days ago
Maximal termsets as a query structuring mechanism
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
Bruno Pôssas, Nivio Ziviani, Berthier A. Rib...
ICML
1998
IEEE
14 years 8 months ago
An Efficient Boosting Algorithm for Combining Preferences
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
Yoav Freund, Raj D. Iyer, Robert E. Schapire, Yora...
BMCBI
2010
161views more  BMCBI 2010»
13 years 7 months ago
CGHpower: exploring sample size calculations for chromosomal copy number experiments
Background: Determining a suitable sample size is an important step in the planning of microarray experiments. Increasing the number of arrays gives more statistical power, but ad...
Ilari Scheinin, Jose A. Ferreira, Sakari Knuutila,...