|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 10 publication records. Showing 10 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Takeshi Matsuda, Daiki Koizumi, Michio Sonoda, Shigeichi Hirasawa |
On predictive errors of SQL injection attack detection by the feature of the single character.  |
SMC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michio Sonoda, Takeshi Matsuda, Daiki Koizumi, Shigeichi Hirasawa |
On automatic detection of SQL injection attacks by the feature extraction of the single character. |
SIN |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeshi Matsuda, Hidehisa Nakayama, Xuemin (Sherman) Shen, Yoshiaki Nemoto, Nei Kato |
Gateway Selection Protocol in Hybrid MANET Using DYMO Routing. |
MONET |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Livingstone, Hidehisa Nakayama, Takeshi Matsuda, Xuemin Shen, Nei Kato |
Gateway Selection in Multi-Hop Wireless Networks Using Route and Link Optimization. |
GLOBECOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeshi Matsuda, Hidehisa Nakayama, Sherman Shen, Yoshiaki Nemoto, Nei Kato |
On Gateway Selection Protocol for DYMO-Based MANET. |
WiMob |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeshi Matsuda, Sumio Watanabe |
On a Singular Point to Contribute to a Learning Coefficient and Weighted Resolution of Singularities. |
ICANN |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeshi Matsuda, Sumio Watanabe |
The Calculation Method of Learning Coefficients by Weighted Resolution of Singularities. |
MLMTA |
2007 |
DBLP BibTeX RDF |
|
| 1 | Takeshi Matsuda, Satoshi Murata |
Stiffness Distribution Control - Locomotion of closed Link Robot with Mechanical Softness. |
ICRA |
2006 |
DBLP BibTeX RDF |
|
| 1 | Takeshi Matsuda, Sumio Watanabe |
Analytic Equivalence of Bayes a Posteriori Distributions. |
ICANN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda |
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. |
ISAAC |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #10 of 10 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")