28888 search results - page 199 / 5778 » Computability and complexity in analysis |
TKDE
2010
13 years 6 months ago
2010
— Tampering of a database can be detected through the use of cryptographically-strong hash functions. Subsequently-applied forensic analysis algorithms can help determine when, w...
HYBRID
2010
Springer
14 years 3 months ago
2010
Springer
The complexity of physical and engineering systems, both in terms of the governing physical phenomena and the number of subprocesses involved, is mirrored in ever more complex mat...
COMGEO
2004
ACM
13 years 8 months ago
2004
ACM
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
ICSOC
2010
Springer
13 years 6 months ago
2010
Springer
In Service-Oriented Computing (SOC), fragmentation and merging of workflows are motivated by a number of concerns, among which we can cite design issues, performance, and privacy. ...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...