Sciweavers

715 search results - page 44 / 143
» On graphs with subgraphs having large independence numbers
Sort
View
ISPASS
2008
IEEE
14 years 3 months ago
Independent Component Analysis and Evolutionary Algorithms for Building Representative Benchmark Subsets
— This work addresses the problem of building representative subsets of benchmarks from an original large set of benchmarks, using statistical analysis techniques. The subsets sh...
Vassilios N. Christopoulos, David J. Lilja, Paul R...
WWW
2007
ACM
14 years 9 months ago
Extraction and classification of dense communities in the web
The World Wide Web (WWW) is rapidly becoming important for society as a medium for sharing data, information and services, and there is a growing interest in tools for understandi...
Yon Dourisboure, Filippo Geraci, Marco Pellegrini
CICLING
2009
Springer
14 years 9 months ago
Enriching Statistical Translation Models Using a Domain-Independent Multilingual Lexical Knowledge Base
This paper presents a method for improving phrase-based Statistical Machine Translation systems by enriching the original translation model with information derived from a multilin...
Miguel García, Jesús Giménez,...
CIDR
2009
157views Algorithms» more  CIDR 2009»
13 years 10 months ago
SCADS: Scale-Independent Storage for Social Computing Applications
Collaborative web applications such as Facebook, Flickr and Yelp present new challenges for storing and querying large amounts of data. As users and developers are focused more on...
Michael Armbrust, Armando Fox, David A. Patterson,...
FOCS
2009
IEEE
14 years 3 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu