Sciweavers

5473 search results - page 790 / 1095
» On the graph isomorphism problem
Sort
View
MFCS
2009
Springer
16 years 1 months ago
Synthesis for Structure Rewriting Systems
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
Lukasz Kaiser
PKDD
2009
Springer
124views Data Mining» more  PKDD 2009»
16 years 1 months ago
Capacity Control for Partially Ordered Feature Sets
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
Ulrich Rückert
170
Voted
ISSTA
2009
ACM
16 years 1 months ago
Memory slicing
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
Bin Xin, Xiangyu Zhang
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
16 years 1 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
CDC
2008
IEEE
162views Control Systems» more  CDC 2008»
16 years 1 months ago
Synchronization in networks of nonlinear oscillators with coupling delays
Abstract— We consider the synchronization problem of an arbitrary number of coupled nonlinear oscillators with delays in the interconnections. The emphasis is on coupled Lorenz s...
Wim Michiels, Henk Nijmeijer