5606 search results - page 251 / 1122 » Randomization Techniques for Graphs. |
174
click to vote
DEXAW
1999
IEEE
15 years 10 months ago
1999
IEEE
Objects like road networks, CAD/CAM components, electrical or electronic circuits, molecules, can be represented as graphs, in many modern applications. In this paper, we propose ...
260
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
A large part of the data on the World Wide Web is hidden behind form-like interfaces. These interfaces interact with a hidden backend database to provide answers to user queries. ...
144
click to vote
ASPDAC
2006
ACM
16 years 14 days ago
2006
ACM
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
163
click to vote
TOMS
2010
15 years 4 months ago
2010
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
165
click to vote
IBPRIA
2007
Springer
15 years 10 months ago
2007
Springer
Random forest is a collection (ensemble) of decision trees. It is a popular ensemble technique in pattern recognition. In this article, we apply random forest for cancer classifica...