Sciweavers

1887 search results - page 20 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
CORR
2010
Springer
342views Education» more  CORR 2010»
13 years 5 months ago
Canonizable Partial Order Generators
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
Mateus de Oliveira Oliveira
SODA
2010
ACM
147views Algorithms» more  SODA 2010»
13 years 5 months ago
Energy Efficient Scheduling via Partial Shutdown
Motivated by issues of saving energy in data centers we define a collection of new problems referred to as "machine activation" problems. The central framework we introd...
Samir Khuller, Jian Li, Barna Saha
ICPR
2008
IEEE
14 years 8 months ago
Multiple kernel learning from sets of partially matching image features
Abstract: Kernel classifiers based on Support Vector Machines (SVM) have achieved state-ofthe-art results in several visual classification tasks, however, recent publications and d...
Guo ShengYang, Min Tan, Si-Yao Fu, Zeng-Guang Hou,...
CAV
1998
Springer
98views Hardware» more  CAV 1998»
13 years 12 months ago
Verification of Timed Systems Using POSETs
This paper presents a new algorithm for efficiently verifying timed systems. The new algorithm represents timing information using geometric regions and explores the timed state sp...
Wendy Belluomini, Chris J. Myers
ECIR
2008
Springer
13 years 9 months ago
Computing Information Retrieval Performance Measures Efficiently in the Presence of Tied Scores
Abstract. The Information Retrieval community uses a variety of performance measures to evaluate the effectiveness of scoring functions. In this paper, we show how to adapt six pop...
Frank McSherry, Marc Najork