Sciweavers

2743 search results - page 398 / 549
» Minimization of an M-convex Function
Sort
View
COMPGEOM
2007
ACM
15 years 9 months ago
Bi-criteria linear-time approximations for generalized k-mean/median/center
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
15 years 9 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
EUROSSC
2009
Springer
15 years 9 months ago
Using Dempster-Shafer Theory of Evidence for Situation Inference
Abstract. In the domain of ubiquitous computing, the ability to identify the occurrence of situations is a core function of being ’contextaware’. Given the uncertain nature of ...
Susan McKeever, Juan Ye, Lorcan Coyle, Simon A. Do...
SIROCCO
2010
15 years 7 months ago
On the Impact of Local Taxes in a Set Cover Game
Given a collection C of weighted subsets of a ground set E, the set cover problem is to find a minimum weight subset of C which covers all elements of E. We study a strategic game ...
Bruno Escoffier, Laurent Gourvès, Jé...
HCI
2007
15 years 7 months ago
Exchanging Graphical Emails Among Elderly People and Kindergarten Children
Email is a convenient tool, however, it is still difficult for elderly people and kindergarten children. If they can learn to use it, their ability to communicate may be remarkably...
Megumi Mitsumoto, Sanae H. Wake