Sciweavers

872 search results - page 73 / 175
» Extreme lower probabilities
Sort
View
FOCS
2005
IEEE
15 years 6 months ago
Towards a Final Analysis of Pairing Heaps
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...
Seth Pettie
101
Voted
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
15 years 6 months ago
A Scalable Collaborative Filtering Framework Based on Co-Clustering
Collaborative filtering-based recommender systems, which automatically predict preferred products of a user using known preferences of other users, have become extremely popular ...
Thomas George, Srujana Merugu
RTAS
2005
IEEE
15 years 6 months ago
On Schedulability Bounds of Static Priority Schedulers
—Real-time systems need to use the schedulability test to determine whether or not admitted tasks can meet their deadlines. The utilization based schedulability test is the most ...
Jianjia Wu, Jyh-Charn Liu, Wei Zhao
WETICE
2005
IEEE
15 years 6 months ago
Data access optimization on grid systems
— The execution of data intensive grid applications still raises several questions regarding job scheduling, data migration and replication. The optimization techniques applied b...
László Csaba Lorincz, Tamás K...
95
Voted
MFCS
2005
Springer
15 years 6 months ago
Nondeterministic Graph Searching: From Pathwidth to Treewidth
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse