Sciweavers

1420 search results - page 157 / 284
» Representation of Graphs by OBDDs
Sort
View
COLT
2007
Springer
16 years 22 days ago
Property Testing: A Learning Theory Perspective
Property testing deals with tasks where the goal is to distinguish between the case that an object (e.g., function or graph) has a prespecified property (e.g., the function is li...
Dana Ron
IJON
2006
87views more  IJON 2006»
15 years 6 months ago
Translation-invariant classification of non-stationary signals
Non-stationary signal classification is a complex problem. This problem becomes even more difficult if we add the following hypothesis: each signal includes a discriminant wavefor...
Vincent Guigue, Alain Rakotomamonjy, Stépha...
CVPR
2007
IEEE
16 years 8 months ago
A Multi-Resolution Dynamic Model for Face Aging Simulation
In this paper we present a dynamic model for simulating face aging process. We adopt a high resolution grammatical face model[1] and augment it with age and hair features. This mo...
Jin-Li Suo, Feng Min, Song Chun Zhu, Shiguang Shan...
ATAL
2010
Springer
15 years 7 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
CONEXT
2009
ACM
15 years 7 months ago
Exploiting dynamicity in graph-based traffic analysis: techniques and applications
Network traffic can be represented by a Traffic Dispersion Graph (TDG) that contains an edge between two nodes that send a particular type of traffic (e.g., DNS) to one another. T...
Marios Iliofotou, Michalis Faloutsos, Michael Mitz...