Sciweavers

5473 search results - page 664 / 1095
» On the graph isomorphism problem
Sort
View
IJBIDM
2008
114views more  IJBIDM 2008»
15 years 6 months ago
Traffic mining in a road-network: How does the traffic flow?
: The flow of data coming from modern sensing devices enables the development of novel research techniques related to data management and knowledge extraction. In this work, we und...
Irene Ntoutsi, Nikos Mitsou, Gerasimos Marketos
NETWORKS
2008
15 years 6 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
TASLP
2008
123views more  TASLP 2008»
15 years 6 months ago
Normalized Cuts for Predominant Melodic Source Separation
The predominant melodic source, frequently the singing voice, is an important component of musical signals. In this paper, we describe a method for extracting the predominant sourc...
Mathieu Lagrange, Luis Gustavo Martins, Jennifer M...
APAL
2005
93views more  APAL 2005»
15 years 6 months ago
Logical aspects of Cayley-graphs: the group case
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
Dietrich Kuske, Markus Lohrey
TCOM
2008
120views more  TCOM 2008»
15 years 6 months ago
Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...
Jingyao Zhang, Pingyi Fan, Khaled Ben Letaief