Sciweavers

1984 search results - page 124 / 397
» The colourful feasibility problem
Sort
View
ICIP
2008
IEEE
14 years 12 months ago
LASIC: A model invariant framework for correspondence
In this paper we address two closely related problems. The first is the object detection problem, i.e., the automatic decision of whether a given image represents a known object o...
Bernardo Rodrigues Pires, João Xavier, Jos&...
WINE
2009
Springer
117views Economy» more  WINE 2009»
14 years 4 months ago
Envy-Free Allocations for Budgeted Bidders
We study the problem of identifying prices to support a given allocation of items to bidders in an envy-free way. A bidder will envy another bidder if she would prefer to obtain th...
David Kempe, Ahuva Mu'alem, Mahyar Salek
DOCENG
2006
ACM
14 years 4 months ago
Fast and simple XML tree differencing by sequence alignment
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
Tancred Lindholm, Jaakko Kangasharju, Sasu Tarkoma
RTAS
2005
IEEE
14 years 3 months ago
Energy-Aware Task Allocation for Rate Monotonic Scheduling
We consider the problem of energy minimization for periodic preemptive hard real-time tasks that are scheduled on an identical multiprocessor platform with dynamic voltage scaling...
Tarek A. AlEnawy, Hakan Aydin
AAAI
1990
13 years 11 months ago
Pointing: A Way Toward Explanation Dialogue
Explanation requires a dialogue. Users must be allowed to ask questions about previously given explanations. However, building an interface that allows users to ask follow-up ques...
Johanna D. Moore, William R. Swartout