Sciweavers

26354 search results - page 261 / 5271
» How we refactor, and how we know it
Sort
View
ICDE
2011
IEEE
224views Database» more  ICDE 2011»
14 years 10 months ago
SmartTrace: Finding similar trajectories in smartphone networks without disclosing the traces
—In this demonstration paper, we present a powerful distributed framework for finding similar trajectories in a smartphone network, without disclosing the traces of participatin...
Costandinos Costa, Christos Laoudias, Demetrios Ze...
CCA
2009
Springer
16 years 1 months ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
Martin Ziegler
KBSE
2007
IEEE
16 years 29 days ago
Parseweb: a programmer assistant for reusing open source code on the web
Programmers commonly reuse existing frameworks or libraries to reduce software development efforts. One common problem in reusing the existing frameworks or libraries is that the...
Suresh Thummalapenta, Tao Xie
ICALP
2010
Springer
15 years 11 months ago
Concurrent Knowledge Extraction in the Public-Key Model
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...
Andrew C. Yao, Moti Yung, Yunlei Zhao
ATAL
1995
Springer
15 years 10 months ago
Formalising Motivational Attitudes of Agents
In this paper we present a formalisation of motivational attitudes, the attitudes that are the driving forces behind the actions of agents. We consider the statics of these attitu...
Bernd van Linder, Wiebe van der Hoek, John-Jules C...