Sciweavers

1568 search results - page 119 / 314
» The problem of examination questions in algorithmics
Sort
View
ICPP
2007
IEEE
15 years 10 months ago
SOR: A Static File Assignment Strategy Immune to Workload Characteristic Assumptions in Parallel I/O Systems
The problem of statically assigning nonpartitioned files in a parallel I/O system has been extensively investigated. A basic workload characteristic assumption of existing solutio...
Tao Xie 0004
ICIW
2009
IEEE
15 years 2 months ago
Using Propagation of Distrust to Find Untrustworthy Web Neighborhoods
Web spamming, the practice of introducing artificial text and links into web pages to affect the results of searches, has been recognized as a major problem for search engines. Bu...
Panagiotis Takis Metaxas
CSUR
2000
101views more  CSUR 2000»
15 years 4 months ago
Extracting usability information from user interface events
to extract information at a level of abstraction that is useful to investigators interested in analyzing application usage or evaluating usability. This survey examines computer-ai...
David M. Hilbert, David F. Redmiles
ICML
2008
IEEE
16 years 5 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
WADS
2007
Springer
101views Algorithms» more  WADS 2007»
15 years 10 months ago
Edges and Switches, Tunnels and Bridges
Abstract. Edge casing is a well-known method to improve the readability of drawings of non-planar graphs. A cased drawing orders the edges of each edge crossing and interrupts the ...
David Eppstein, Marc J. van Kreveld, Elena Mumford...