Sciweavers

759 search results - page 82 / 152
» What Can Be Implemented Anonymously
Sort
View
ICIP
2001
IEEE
14 years 11 months ago
N-dimensional zonal algorithms. The future of block based motion estimation?
The popularity of zonal based algorithms for block based motion estimation has been recently increasing due to their superior performance in both terms of reduced complexity and s...
Alexis M. Tourapis, Hye-Yeon Cheong, Ming L. Liou,...
C5
2003
IEEE
14 years 3 months ago
SuperSwiki - Bringing collaboration to the class room
SuperSwiki is a not yet well defined term. Its origins go back to Ward Cunningham's Wiki and its Squeak variant, the Swiki. It provides a place to share and edit web pages, f...
Michael Rüger
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
14 years 2 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
ICLP
2009
Springer
14 years 10 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...
CHI
2009
ACM
14 years 10 months ago
Reflections of everyday activities in spending data
In this paper we show that financial information can be used to sense many aspects of human activity. This simple technique gives people information about their daily lives, is ea...
Julia Schwarz, Jennifer Mankoff, H. Scott Matthews