Sciweavers

2004 search results - page 52 / 401
» Sampling from large graphs
Sort
View
ADBIS
2007
Springer
136views Database» more  ADBIS 2007»
15 years 6 months ago
An Agile Process for the Creation of Conceptual Models from Content Descriptions
It is widely accepted practice to build domain models as a conceptual basis for software systems. Normally, the conceptual schema cannot be supplied by domain experts but is constr...
Sebastian Bossung, Hans-Werner Sehring, Henner Car...
DAC
2006
ACM
16 years 23 days ago
State encoding of large asynchronous controllers
A novel method to solve the state encoding problem in Signal Transition Graphs is presented. It is based on the structural theory of Petri nets and can be applied to large specifi...
Josep Carmona, Jordi Cortadella
SIGCOMM
1992
ACM
15 years 3 months ago
Internet Routing Over Large Public Data Networks Using Shortcuts
With the emergence of large switched public data networks that are well-suited to connectionless internets, for instance SMDS, it is possible that larger and larger numbers of int...
Paul F. Tsuchiya
ICDM
2003
IEEE
126views Data Mining» more  ICDM 2003»
15 years 5 months ago
Mining Relevant Text from Unlabelled Documents
Automatic classification of documents is an important area of research with many applications in the fields of document searching, forensics and others. Methods to perform class...
Daniel Barbará, Carlotta Domeniconi, Ning K...
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 5 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál