Sciweavers

138 search results - page 11 / 28
» Finding Key Bloggers, One Post At A Time
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 7 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
POPL
2003
ACM
14 years 7 months ago
Interprocedural compatibility analysis for static object preallocation
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...
Ovidiu Gheorghioiu, Alexandru Salcianu, Martin C. ...
STOC
2005
ACM
156views Algorithms» more  STOC 2005»
14 years 7 months ago
Convex programming for scheduling unrelated parallel machines
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
Yossi Azar, Amir Epstein
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
13 years 7 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
CORR
2010
Springer
211views Education» more  CORR 2010»
13 years 7 months ago
Studying the Feasibility and Importance of Software Testing: An Analysis
Software testing is a critical element of software quality assurance and represents the ultimate review of specification, design and coding. Software testing is the process of tes...
S. S. Riaz Ahamed