Sciweavers

13841 search results - page 2189 / 2769
» Algorithms and Constraint Programming
Sort
View
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
16 years 23 days ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
MFCS
2005
Springer
16 years 23 days ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
EGH
2004
Springer
16 years 19 days ago
Tile-based texture mapping on graphics hardware
Texture mapping has been a fundamental feature for commodity graphics hardware. However, a key challenge for texture mapping is how to store and manage large textures on graphics ...
Li-Yi Wei
GECCO
2004
Springer
110views Optimization» more  GECCO 2004»
16 years 19 days ago
Using GP to Model Contextual Human Behavior
To create a realistic environment, some simulations require simulated agents with human behavior pattern. Creating such agents with realistic behavior can be a tedious and time con...
Hans Fernlund, Avelino J. Gonzalez
IFIP
2004
Springer
16 years 19 days ago
Isolated Word Recognition for English Language Using LPC, VQ and HMM
: Speech recognition is always looked upon as a fascinating field in human computer interaction. It is one of the fundamental steps towards understanding human cognition and their ...
Mayukh Bhaowal, Kunal Chawla
« Prev « First page 2189 / 2769 Last » Next »