Sciweavers

1096 search results - page 166 / 220
» Evaluating Algorithms for Concept Description
Sort
View
ECLIPSE
2006
ACM
14 years 2 months ago
HAM: cross-cutting concerns in Eclipse
As programs evolve, newly added functionality sometimes no longer aligns with the original design, ending up scattered across the software system. Aspect mining tries to identify ...
Silvia Breu, Thomas Zimmermann, Christian Lindig
ICRA
2003
IEEE
144views Robotics» more  ICRA 2003»
14 years 1 months ago
Error-tolerant execution of complex robot tasks based on skill primitives
— This paper presents a general approach to specify and execute complex robot tasks considering uncertain environments. Robot tasks are defined by a precise definition of socal...
Ulrike Thomas, Bernd Finkemeyer, Torsten Krög...
SIGIR
2012
ACM
11 years 11 months ago
Explanatory semantic relatedness and explicit spatialization for exploratory search
Exploratory search, in which a user investigates complex concepts, is cumbersome with today’s search engines. We present a new exploratory search approach that generates interac...
Brent Hecht, Samuel Carton, Mahmood Quaderi, Johan...
CIKM
2009
Springer
14 years 3 months ago
POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice
Data generalization is widely used to protect identities and prevent inference of sensitive information during the public release of microdata. The k-anonymity model has been exte...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 9 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel