Sciweavers

534 search results - page 71 / 107
» Diameter critical graphs
Sort
View
ICDM
2008
IEEE
107views Data Mining» more  ICDM 2008»
15 years 5 months ago
Graph-Based Iterative Hybrid Feature Selection
When the number of labeled examples is limited, traditional supervised feature selection techniques often fail due to sample selection bias or unrepresentative sample problem. To ...
ErHeng Zhong, Sihong Xie, Wei Fan, Jiangtao Ren, J...
FPGA
1998
ACM
142views FPGA» more  FPGA 1998»
15 years 3 months ago
A Hybrid Complete-Graph Partial-Crossbar Routing Architecture for Multi-FPGA Systems
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
Mohammed A. S. Khalid, Jonathan Rose
CAV
2010
Springer
239views Hardware» more  CAV 2010»
15 years 1 months ago
Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs
Triggering errors in concurrent programs is a notoriously difficult task. A key reason for this is the behavioral complexity resulting from the large number of interleavings of op...
Vineet Kahlon, Chao Wang
MICRO
2006
IEEE
100views Hardware» more  MICRO 2006»
15 years 5 months ago
Serialization-Aware Mini-Graphs: Performance with Fewer Resources
Instruction aggregation—the grouping of multiple operations into a single processing unit—is a technique that has recently been used to amplify the bandwidth and capacity of c...
Anne Bracy, Amir Roth
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 2 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó