Sciweavers

5606 search results - page 231 / 1122
» Randomization Techniques for Graphs.
Sort
View
CN
2000
109views more  CN 2000»
15 years 19 days ago
On near-uniform URL sampling
We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the ...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
142
Voted
TVCG
2011
136views more  TVCG 2011»
14 years 7 months ago
Interactive Mesh Cutting Using Constrained Random Walks
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
Juyong Zhang, Jianmin Zheng, Jianfei Cai
122
Voted
COMPSAC
2010
IEEE
14 years 10 months ago
GenRed: A Tool for Generating and Reducing Object-Oriented Test Cases
An important goal of automatic testing techniques, including random testing is to achieve high code coverage with a minimum set of test cases. To meet this goal, random testing res...
Hojun Jaygarl, Kai-Shin Lu, Carl K. Chang
139
Voted
ACMSE
2009
ACM
15 years 7 months ago
Applying randomized projection to aid prediction algorithms in detecting high-dimensional rogue applications
This paper describes a research effort to improve the use of the cosine similarity information retrieval technique to detect unknown, known or variances of known rogue software by...
Travis Atkison
STOC
1994
ACM
93views Algorithms» more  STOC 1994»
15 years 4 months ago
Scalable expanders: exploiting hierarchical random wiring
Recent work has shown many advantages to randomly wired expander-based networks. Unfortunately, the wiring complexity of such networks becomes physically problematic as they becom...
Eric A. Brewer, Frederic T. Chong, Tom Leighton