Sciweavers

692 search results - page 133 / 139
» Why Experimentation can be better than
Sort
View
106
Voted
CIDR
2007
141views Algorithms» more  CIDR 2007»
14 years 11 months ago
Fragmentation in Large Object Repositories
Fragmentation leads to unpredictable and degraded application performance. While these problems have been studied in detail for desktop filesystem workloads, this study examines n...
Russell Sears, Catharine van Ingen
SDM
2010
SIAM
226views Data Mining» more  SDM 2010»
14 years 11 months ago
Two-View Transductive Support Vector Machines
Obtaining high-quality and up-to-date labeled data can be difficult in many real-world machine learning applications, especially for Internet classification tasks like review spam...
Guangxia Li, Steven C. H. Hoi, Kuiyu Chang
SIGCOMM
2010
ACM
14 years 9 months ago
An analysis of social network-based Sybil defenses
Recently, there has been much excitement in the research community over using social networks to mitigate multiple identity, or Sybil, attacks. A number of schemes have been propo...
Bimal Viswanath, Ansley Post, P. Krishna Gummadi, ...
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
14 years 9 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
BMCBI
2010
108views more  BMCBI 2010»
14 years 9 months ago
A genetic ensemble approach for gene-gene interaction identification
Background: It has now become clear that gene-gene interactions and gene-environment interactions are ubiquitous and fundamental mechanisms for the development of complex diseases...
Pengyi Yang, Joshua W. K. Ho, Albert Y. Zomaya, Bi...