Sciweavers

4761 search results - page 815 / 953
» Generalizing Boundary Points
Sort
View
107
Voted
AAAI
2008
15 years 3 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
112
Voted
CP
2008
Springer
15 years 2 months ago
Model Restarts for Structural Symmetry Breaking
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
Daniel S. Heller, Aurojit Panda, Meinolf Sellmann,...
CPAIOR
2008
Springer
15 years 2 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
IMC
2007
ACM
15 years 2 months ago
Legal issues surrounding monitoring during network research
This work was motivated by a discussion that two of the coauthors (computer science professors) had with the other coauthor (a law professor and a former computer crime Trial Atto...
Douglas C. Sicker, Paul Ohm, Dirk Grunwald
IMC
2007
ACM
15 years 2 months ago
Cryptographic strength of ssl/tls servers: current and recent practices
The Secure Socket Layer (SSL) and its variant, Transport Layer Security (TLS), are used toward ensuring server security. In this paper, we characterize the cryptographic strength ...
Homin K. Lee, Tal Malkin, Erich M. Nahum