Sciweavers

900 search results - page 114 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
CHI
2011
ACM
13 years 9 days ago
The concept maps method as a tool to evaluate the usability of APIs
Application programming interfaces (APIs) are the interfaces to existing code structures, such as widgets, frameworks, or toolkits. Therefore, they very much do have an impact on ...
Jens Gerken, Hans-Christian Jetter, Michael Zö...
IWCM
2004
Springer
14 years 2 months ago
Tracking Complex Objects Using Graphical Object Models
We present a probabilistic framework for component-based automatic detection and tracking of objects in video. We represent objects as spatio-temporal two-layer graphical models, w...
Leonid Sigal, Ying Zhu, Dorin Comaniciu, Michael J...
CIS
2006
Springer
14 years 14 days ago
A New Parallel Multiplier for Type II Optimal Normal Basis
In hardware implementation for the finite field, the use of normal basis has several advantages, especially the optimal normal basis is the most efficient to hardware implementati...
Chang Han Kim, Yongtae Kim, Sung Yeon Ji, IlWhan P...
SIGMOD
2002
ACM
129views Database» more  SIGMOD 2002»
14 years 8 months ago
Dwarf: shrinking the PetaCube
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
Yannis Sismanis, Antonios Deligiannakis, Nick Rous...
PODC
2011
ACM
12 years 11 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer