Sciweavers

455 search results - page 26 / 91
» On Trees and Noncrossing Partitions
Sort
View
IWPEC
2009
Springer
14 years 2 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
DASFAA
2004
IEEE
135views Database» more  DASFAA 2004»
13 years 11 months ago
Semi-supervised Text Classification Using Partitioned EM
Text classification using a small labeled set and a large unlabeled data is seen as a promising technique to reduce the labor-intensive and time consuming effort of labeling traini...
Gao Cong, Wee Sun Lee, Haoran Wu, Bing Liu
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
14 years 9 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
LCTRTS
2010
Springer
14 years 2 months ago
Analysis and approximation for bank selection instruction minimization on partitioned memory architecture
A large number of embedded systems include 8-bit microcontrollers for their energy efficiency and low cost. Multi-bank memory architecture is commonly applied in 8-bit microcontr...
Minming Li, Chun Jason Xue, Tiantian Liu, Yingchao...
EGH
2009
Springer
13 years 5 months ago
Object partitioning considered harmful: space subdivision for BVHs
A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...
Stefan Popov, Iliyan Georgiev, Rossen Dimov, Phili...