Sciweavers

256 search results - page 40 / 52
» Separation of NP-Completeness Notions
Sort
View
ECIS
2004
15 years 1 months ago
Using IT to Make Place in Space: Evaluating Mobile Technology Support for Sport Spectators
This paper reports results from two field trials of TrottingPal, a mobile system that supports event information management and seamless collaboration between spectators at the tr...
Andreas Nilsson
NIPS
2001
15 years 1 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
ENTCS
2002
113views more  ENTCS 2002»
14 years 11 months ago
A monadic approach to polycategories
In the quest for an elegant formulation of the notion of "polycategory" we develop a more symmetric counterpart to Burroni's notion of "T-category", where ...
Jürgen Koslowski
POPL
2006
ACM
16 years 4 days ago
Specifying C++ concepts
C++ templates are key to the design of current successful mainstream libraries and systems. They are the basis of programming techniques in diverse areas ranging from conventional...
Gabriel Dos Reis, Bjarne Stroustrup
ICCAD
2006
IEEE
190views Hardware» more  ICCAD 2006»
15 years 8 months ago
Factor cuts
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...