Sciweavers

8903 search results - page 1764 / 1781
» Alternative
Sort
View
CHI
2011
ACM
14 years 1 months ago
Am I wasting my time organizing email?: a study of email refinding
We all spend time every day looking for information in our email, yet we know little about this refinding process. Some users expend considerable preparatory effort creating compl...
Steve Whittaker, Tara Matthews, Julian A. Cerruti,...
CIDR
2011
401views Algorithms» more  CIDR 2011»
14 years 1 months ago
DBease: Making Databases User-Friendly and Easily Accessible
Structured query language (SQL) is a classical way to access relational databases. Although SQL is powerful to query relational databases, it is rather hard for inexperienced user...
Guoliang Li, Ju Fan, Hao Wu, Jiannan Wang, Jianhua...
COMPGEOM
2011
ACM
14 years 1 months ago
Deconstructing approximate offsets
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...
CVIU
2011
14 years 1 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
EDBT
2011
ACM
199views Database» more  EDBT 2011»
14 years 1 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
« Prev « First page 1764 / 1781 Last » Next »